# Minesweeper

A puzzle in which the player needs to identify the location hidden mines in a rectangular board by using numeric clues.

## Description

Minesweeper is an interactive puzzle played on a rectagular $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 coodinates 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 definitly or possibly containing a mine.

## Computational complexity

A configuration consists of a board whose revealed tiles are labeled and whose unrevaled squares are possibly marked as mines.
A configuration is consistent if there exhist 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 [2] 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). [2].

The *minesweeper consistency* problem [1] asks to decide whether a given configuration is consistent.
Minesweeper consistancy is NP-complete.

Any algoritm for minesweeper consistency yields an algorithm for minesweeper inference with a $O(n \cdot m)$-time blow-up. [1] [2]

## References

[1] R. Kaye, “Minesweeper is NP-complete”, The Mathematical Intelligencer, 2000.

[2] A. Scott, U. Stege, I. van Rooij, “Minesweeper May Not Be NP-Complete but Is Hard Nonetheless”, The Mathematical Intelligencer, 2011.