Minesweeper, the game as usually played, is not NP complete.
The "minesweeper consistency problem" is, apparently.
The two are entirely different beasts. When one plays minesweeper, one assumes that the game is internally consistent and that you won't have to solve the consistency problem; in fact if one encounters evidence that the game is NOT consistent, one usually stops playing in disgust.
Likewise, my [arbitrary problem that's provably NOT NP-complete] software runs on a computer that performs computations using the same underlying boolean logic elements. That doesn't make my software NP-complete, either.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
no subject
Date: 2004-04-30 05:11 pm (UTC)Minesweeper, the game as usually played, is not NP complete.
The "minesweeper consistency problem" is, apparently.
The two are entirely different beasts. When one plays minesweeper, one assumes that the game is internally consistent and that you won't have to solve the consistency problem; in fact if one encounters evidence that the game is NOT consistent, one usually stops playing in disgust.
Likewise, my [arbitrary problem that's provably NOT NP-complete] software runs on a computer that performs computations using the same underlying boolean logic elements. That doesn't make my software NP-complete, either.