Random Minesweeper on an n-cell grid is whp solvable in linear time when p = o(n^{-1/6}) and whp unsolvable by any algorithm when p >> n^{-1/6}.
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Phase transition for Minesweeper
Random Minesweeper on an n-cell grid is whp solvable in linear time when p = o(n^{-1/6}) and whp unsolvable by any algorithm when p >> n^{-1/6}.