Comment Re:Proof by example? (Score 1) 457
Replying to my own comment.
The minesweeper consistency problem is actually NP-complete. That problem consists of trying to find a mine-solution to the numbers on a grid.
http://www.claymath.org/Popular_Lectures/Minesweeper/
The minesweeper consistency problem is actually NP-complete. That problem consists of trying to find a mine-solution to the numbers on a grid.
http://www.claymath.org/Popular_Lectures/Minesweeper/