Minesweeper is NP-complete

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Richard Kaye.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kaye, R. Minesweeper is NP-complete. The Mathematical Intelligencer 22, 9–15 (2000). https://doi.org/10.1007/BF03025367

Download citation

Keywords

  • Polynomial Time
  • Mathematical Intelligencer
  • Boolean Formula
  • Boolean Circuit
  • Important Open Problem