Minesweeper May Not Be NP-Complete but Is Hard Nonetheless

1 min read Original article ↗

Access this article

Log in via an institution

Subscribe and save

  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

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

  1. Department of Computer Science, University of Victoria, Victoria, BC, V8W 3P6, Canada

    Allan Scott & Ulrike Stege

  2. Donders Institute for Brain, Cognition, and Behavior, Radboud University Nijmegen, 6500 HB, Nijmegen, The Netherlands

    Iris van Rooij

Authors

  1. Allan Scott
  2. Ulrike Stege
  3. Iris van Rooij

Corresponding author

Correspondence to Allan Scott.

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