| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4628047 | Applied Mathematics and Computation | 2014 | 11 Pages |
Abstract
Minesweeper is a popular single player game. Various strategies have been suggested in order to improve the probability of winning the game. In this paper, we present an optimal strategy for playing Minesweeper on a graph when it is known that exactly one cell is mined.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Shahar Golan,