Minesweeper on graphs

DOI10.1016/J.AMC.2011.01.046zbMath1208.91027OpenAlexW2070641010MaRDI QIDQ632908

Shahar Golan

Publication date: 28 March 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.046

zbMATH Keywords

generating polynomialsdynamic programmingconsistencytreewidthCSPconstraint satisfactioncounting problemminesweeper

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Combinatorial games (91A46)

Related Items (2)

Minesweeper strategy for one mine ⋮ On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon

Cites Work

• Unnamed Item
• Graph minors. I. Excluding a forest
• Treewidth. Computations and approximations
• How cellular automaton plays minesweeper
• ‘Minesweeper’ and spectrum of discrete Laplacians
• Equal moments division of a set
• Graph minors. II. Algorithmic aspects of tree-width
• The Minesweeper Game: Percolation and Complexity
• Littlewood polynomials with high order zeros
• Minesweeper is NP-complete.

This page was built for publication: Minesweeper on graphs