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}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 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}.