Abstract

this paper is my article [5] showing that the wellknown Minesweeper game is NP-complete. The proof was by making suitable minesweeper configurations simulate digital computers, with logic gates such as and and not gates. This is reminiscent of John Conway's game of life [2] which was proved to be Turing complete by similar means [1]. (For background information on Turing machines and computability please see just about any text book on these. I found the account by Wang [7] particularly enjoyable and can recommend it as it presents just about the right about of material needed here in a straightforward and not too technical manner.) It is reasonable to ask whether or not there is an version of Minesweeper

Citations