4 citations · 9 across the 8 of their papers we have counts for
1 paper · 1 filter
Eryk Kopczyński
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…