Skip to main content
Log in

Minesweeper May Not Be NP-Complete but Is Hard Nonetheless

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Author information

Authors and 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

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00283-011-9256-x

Keywords

Navigation