The Minesweeper Game: Percolation and Complexity

DOI10.1017/S096354830200528XMaRDI QIDQ4796017zbMATH OpenOpenAlexFDO

Authors Elchanan Mossel

Publication date 11 May 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096354830200528x

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Graph theory (05C99)

Recommendations

• A phase transition in Minesweeper
• Percolation and the complexity of games
• Luckless graphical minesweeper
• Minesweeper on graphs
• Minesweeper may not be NP-complete but is hard nonetheless

Cited in

(8)

• Minesweeper on graphs
• Maker–Breaker percolation games I: crossing grids
• A phase transition in Minesweeper
• Hyperbolic Minesweeper is in P
• Percolation and the complexity of games
• Luckless graphical minesweeper
• Application of spectral theory to constructing a puzzle on the basis of the Minesweeper computer game
• Minesweeper strategy for one mine

This page was built for publication: The Minesweeper Game: Percolation and Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796017)