Minesweeper is NP-complete

@article{Kaye2000MinesweeperIN,
  title={Minesweeper is NP-complete},
  author={Richard Kaye},
  journal={The Mathematical Intelligencer},
  year={2000},
  volume={22},
  pages={9-15}
}
  • R. Kaye
  • Published 1 March 2000
  • Computer Science
  • The Mathematical Intelligencer
NP-completeness Many programming p rob lems require the design of an algor i thm which has a "yes" or "no" ou tput for each input. For example , the p rob lem of test ing a whole number for pr imal i ty requires an a lgor i thm which answers "yes" if the input number x is prime, and "no" otherwise. In trying to devise an algori thm to solve a given problem, one aspec t of obvious pract ical impor tance is the t ime it takes to run. Since a typical algori thm may take more t ime on some inputs… 

29 Np-hard Problems 29.1 'efficient' Problems

A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1

Infinite versions of minesweeper are Turing complete

In this paper it is shown that there is an version of Minesweeper analogous to Life that is also Turing complete, and this paper is interested in versions of minesweeper played on an infinite grid.

The computational complexity of Minesweeper

It is shown that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability, and determining the solvability of a partially uncovered Minesweep board is NP-complete with hexagonal and triangular grids as well as a square grid.

Minesweeper as a Constraint Satisfaction Problem

Minesweeper is a simple one−player computer game commonly found on machines with popular operating systems such as Linux or Microsoft Windows. The game consists of a 2 dimensional rectangular playing

An Interactive Constraint-Based Approach to Minesweeper

We present a Java applet that uses Constraint Processing (CP) to assist a human in playing the popular game Minesweeper. Our goal is to illustrate the power of CP techniques to model and solve

The complexity of Solitaire

More Properties for NP-complete Minesweeper Graphs

This article deals with the question whether minesweeper graphs with bounded vertex degrees d ≤ 3 are NP-complete. The answer to this question—stated to be open in [3]—will be positive which gives a

Complexity of n-Queens Completion (Extended Abstract)

The n-Queens problem has been very widely used as a benchmark in Artificial Intelligence, but conclusions on it are often disputable because of the simple complexity of the decision problem, so these results give alternative benchmarks which are hard theoretically and empirically, but for which solving techniques designed for n- Queens need minimal or no change.

Tipover is NP-complete

It turns out that TipOver, like Minesweeper [5] and some other puzzles, is NP-complete; nobody knows how to solve NP- complete problems efficiently; this is the most famous unsolved problem of computer science.

Complexity of n-Queens Completion

The n-Queens problem has been very widely used as a benchmark in Artificial Intelligence, but conclusions on it are often disputable because of the simple complexity of the decision problem, so these results give alternative benchmarks which are hard theoretically and empirically, but for which solving techniques designed for n- Queens need minimal or no change.
...