A Survey of NP-Complete Puzzles

Abstract

Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the approaches for solving them, have emerged. However, many puzzles have been neglected, possibly because they are unknown to many people. In this article, we survey NP-Complete puzzles in the hope of motivating further research in this fascinating area, particularly for those puzzles which have received little scientific attention to date.

Extracted Key Phrases

16 Figures and Tables

Showing 1-10 of 98 references

The Complexity of Puzzles: NP-Completeness Results for Nurikabe and Minesweeper

  • B Mcphail
  • 2003
Highly Influential
4 Excerpts

Corral Puzzles are NP-complete

  • E Friedman
  • 2002
Highly Influential
4 Excerpts

Pearl Puzzles are NP-complete

  • E Friedman
  • 2002
Highly Influential
4 Excerpts

Statistics

010202008200920102011201220132014201520162017
Citations per Year

87 Citations

Semantic Scholar estimates that this publication has received between 53 and 145 citations based on the available data.

See our FAQ for additional information.