Richard Kaye's Minesweeper Page
Edit Page
Report
Scan day: 03 February 2014 UTC
37
Virus safety - good
Description: Papers about the computational complexity of Minesweeper, namely that the usual game is NP-complete and that an infinite variation is Turing-complete.
Richard Kaye's minesweeper page Richard Kaye's Minesweeper Pages Until recently, tiling problems were largely relegated to the domain of "recreational mathematics" (an obvious oxymoron to most non-mathematicians, but a pleonasm to true believers).
Size: 267 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Richard Kaye's minesweeper page |
| Keywords: | Logic Complexity Minesweeper NP NP-complete |
| Description: | Minesweeper and complexity theory, the NP-completeness of Minesweeper |
| IP-address: | 147.188.55.10 |