The Minesweeper Game: Percolation and Complexity

DOI10.1017/S096354830200528XzbMATH Open1010.60086OpenAlexW2095301393MaRDI QIDQ4796017FDOQ4796017

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)