Minesweeper is an interactive puzzle played on a rectangular $n \times m$ board in which each tile is either empty or contains one out of a total of $k$ mines. Initially the contents of all the location are hidden. A move consists of selecting an hidden tile to reveal: if the tile contains a mine the player loses the game immediately, otherwise the tile is revealed as empty and it is labeled with the number of adjacent tiles that contain a mine, where two distinct tiles are considered to be adjacent if each of their coordinates differ by at most $1$ (i.e., each tile is adjacent to up to 8 tiles). The player knows the value of $k$ in advance and wins when all the empty tiles are revealed.
Some common implementations of the game recursively reveal all the neighbors of a tile labeled with “$0$” (which might be displayed as an empty tile) and allow the player to mark the tiles as definitely or possibly containing a mine.
A configuration consists of a board whose revealed tiles are labeled and whose unrevealed squares are possibly marked as mines. A configuration is consistent if there exists a placement of the $k$ mines such that all the marked squares contain a mine and all the labels correspond to the number of adjacent mines.
The (decision version of) minesweeper inference problem  asks to determine, given a consistent configuration, whether there exists a covered square that either (i) is unmarked and definitely contains a mine, or (ii) is definitely empty. Minesweeper inference is co-NP-complete (a no-certificate consists, for each covered tile, of a pair of consistent configurations that disagree on that tile). .
The minesweeper consistency problem  asks to decide whether a given configuration is consistent. Minesweeper consistency is NP-complete.
 R. Kaye, “Minesweeper is NP-complete”, The Mathematical Intelligencer, 2000.
 A. Scott, U. Stege, I. van Rooij, “Minesweeper May Not Be NP-Complete but Is Hard Nonetheless”, The Mathematical Intelligencer, 2011.