How cellular automaton plays minesweeper

DOI10.1016/S0096-3003(96)00117-8zbMath0882.68099WikidataQ56687814 ScholiaQ56687814MaRDI QIDQ1366821

Andrew Adamatzky

Publication date: 17 September 1997

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

zbMATH Keywords

deterministic cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

Minesweeper strategy for one mine ⋮ Minesweeper on graphs ⋮ Application of spectral theory to constructing a puzzle on the basis of the Minesweeper computer game ⋮ ‘Minesweeper’ and spectrum of discrete Laplacians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of shortest path in cellular automata
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• The σ-Game and Cellular Automata

This page was built for publication: How cellular automaton plays minesweeper