Richard Kaye's Minesweeper Page
Papers about the computational complexity of Minesweeper, namely that the usual game is NP-complete and that an infinite variation is Turing-complete.

	Keyword	Results for this URL	Total searches