Richard Kaye's Minesweeper Page

Richard Kaye's Minesweeper Page
All Links

Share this:

Details of Richard Kaye's Minesweeper Page

About Richard Kaye's Minesweeper Page
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.
Jak and Daxter Series