Browse New Popular Keyword Cloud Advanced Search Submit a Link
All ArtsBusinessChildrenComputersGamesHealthHomeNewsRecreationReferenceRegionalScienceShoppingSocietySports
Advertise herefrom $25.00/day  ·  RON $40.00/day

Richard Kaye's Minesweeper Page

eb.mat.bham.ac.uk
Visit Site

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

Category
Minesweeper
Visits
427
Added
Feb 15, 2024
Rating
(57)
Rate This Site
More in Minesweeper Report
QR Code
QR code Download PNG
Embed Badge
Place this code on your website to show you're listed here.
Advertise herefrom $12.00/day  ·  RON $18.00/day
Advertise herefrom $10.00/day  ·  RON $15.00/day
Advertise herefrom $8.00/day  ·  RON $11.20/day
Submit Your Site

Add your website to our directory for free.

Submit a Link
Related Links
Hexatron 499 visits
Planet Minesweeper 490 visits
MineSweeper3D 486 visits
#1 MineSweeper 457 visits
Hex Minesweeper 426 visits
Advertise herefrom $15.00/day  ·  RON $21.00/day
Get the best links delivered weekly — hand-picked from 2,999,517 resources