Minesweeper May Not Be NP-Complete but Is Hard Nonetheless

Author information

Affiliations

Authors

Corresponding author

Correspondence to Allan Scott.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Scott, A., Stege, U. & van Rooij, I. Minesweeper May Not Be NP-Complete but Is Hard Nonetheless. Math Intelligencer 33, 5–17 (2011). https://doi.org/10.1007/s00283-011-9256-x

Download citation

Keywords

  • Polynomial Time
  • Mathematical Intelligencer
  • Conjunctive Normal Form
  • Truth Assignment
  • Boolean Formula