Hyperbolic Minesweeper is in P
Computational Complexity
2023-08-02 v2 Artificial Intelligence
Abstract
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.
Cite
@article{arxiv.2002.09534,
title = {Hyperbolic Minesweeper is in P},
author = {Eryk Kopczyński},
journal= {arXiv preprint arXiv:2002.09534},
year = {2023}
}
Comments
fixed an error in Corollary 5.6: planar graph -> (r,d)-hyperbolic graph