Application of spectral theory to constructing a puzzle on the basis of the Minesweeper computer game

DOI10.1134/S0001434610110295MaRDI QIDQ650362zbMATH OpenOpenAlexFDO

Authors Oleg N. German, E. Lakshtanov

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434610110295

zbMATH Keywords

spectral theorydifferential operatorundirected graphcomputer game Minesweeper

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• `Minesweeper' and spectrum of discrete Laplacians
• Taking Sudoku seriously. The math behind the world's most popular pencil puzzle
• Luckless graphical minesweeper
• Minesweeper on graphs
• Minesweeper may not be NP-complete but is hard nonetheless

Cites work

• How cellular automaton plays minesweeper
• Minesweeper is NP-complete.
• The Minesweeper Game: Percolation and Complexity

Cited in

(3)

• Dials and levers and glyphs, oh my! Linear algebra solutions to computer game puzzles
• Algebraic approaches to FlipIt
• `Minesweeper' and spectrum of discrete Laplacians

This page was built for publication: Application of spectral theory to constructing a puzzle on the basis of the Minesweeper computer game

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