Minesweeper strategy for one mine

详细信息    查看全文

• 作者：Shahar Golan ^{golansha@gmail.com" class="auth_mail}
• 关键词：Graph theory ; Strategy ; Probability ; Algorithm ; Games ; Minesweeper
• 刊名：Applied Mathematics and Computation
• 出版年：1 April, 2014
• 年：2014
• 卷：232
• 期：Complete
• 页码：292-302
• 全文大小：531 K

文摘

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.