Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.amc.2014.01.045 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Graph theory,Strategy,Probability,Algorithm,Games,Minesweeper | Graph theory,Graph,Computer science,Artificial intelligence | Journal |
Volume | ISSN | Citations |
232 | 0096-3003 | 2 |
PageRank | References | Authors |
0.66 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shahar Golan | 1 | 57 | 5.72 |