Hyperbolic Minesweeper is in P

02/21/2020

∙

by   Eryk Kopczyński, et al.

∙

0

∙

share

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.