A phase transition in Minesweeper

DOI10.4230/LIPICS.FUN.2021.12MaRDI QIDQ6487580zbMATH OpenFDO

Authors Ross Dempsey, Charles Guinn

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2021.12

zbMATH Keywords

complexity of gamesMinesweeper

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)

Recommendations

• Minesweeper may not be NP-complete but is hard nonetheless
• Minesweeper on graphs
• The Minesweeper Game: Percolation and Complexity
• Hyperbolic Minesweeper is in P
• Luckless graphical minesweeper

Cited in

(4)

• The Minesweeper Game: Percolation and Complexity
• Minesweeper on graphs
• Hyperbolic Minesweeper is in P
• Minesweeper may not be NP-complete but is hard nonetheless

This page was built for publication: A phase transition in Minesweeper

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