Kaye demonstrates NP-completeness of Minesweeper puzzles using digital circuit simulation in educational resources.
Richard Kaye's demonstration that a puzzle based on the Minesweeper game is NP-complete makes this important computer science topic accessible to high school students. The resource described here is a set of slides showing the detailed solution of two introductory puzzles, following by the step-by-step simulation of digital circuit elements required for proving NP-completeness.
No takes yet. Share an insight, caveat, or question.
Mordechai Ben‐Ari (2005) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: