Minesweeper on graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- Equal moments division of a set
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- How cellular automaton plays minesweeper
- Littlewood polynomials with high order zeros
- Minesweeper is NP-complete.
- The Minesweeper Game: Percolation and Complexity
- Treewidth. Computations and approximations
- `Minesweeper' and spectrum of discrete Laplacians
Cited in
(11)- scientific article; zbMATH DE number 7021370 (Why is no real title available?)
- A phase transition in Minesweeper
- Hyperbolic Minesweeper is in P
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon
- `Minesweeper' and spectrum of discrete Laplacians
- Minesweeper may not be NP-complete but is hard nonetheless
- The Minesweeper Game: Percolation and Complexity
- Treasure hunt in graph using pebbles
- 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: Minesweeper on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632908)