Computational Complexity of Minesweeper Variants: Consistency, Inference, and Solvability

The computational complexity of three key decision problems related to the popular game Minesweeper is analyzed: consistency (determining if a set of clues has a valid mine arrangement), inference (determining if a cell can be proven safe), and solvability (determining if a player can win the game by safely clicking all non-mine cells).