LIPIcs.FUN.2021.18.pdf
- Filesize: 1.14 MB
- 7 pages
We show that, while Minesweeper is NP-complete, its hyperbolic variant is in P. Our proof does not rely on the rules of Minesweeper, but is valid for any puzzle based on satisfying local constraints on a graph embedded in the hyperbolic plane.
Feedback for Dagstuhl Publishing