Skip to main content

Minesweeper is NP-complete

The Mathematical Intelligencer volume 22, pages 9–15 (2000)Cite this article

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

Access options

Buy single article

Instant access to the full article PDF.

39,95 €

Price includes VAT (Netherlands)

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, The University of Birmingham, B15 2TT, Birmingham, England

    Richard Kaye

Authors
  1. Richard Kaye
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03025367

Keywords

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