Minesweeper strategy for one mine

Shahar Golan

doi:10.1016/j.amc.2014.01.045

Minesweeper strategy for one mine

Shahar Golan

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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

Original language	English
Pages (from-to)	292-302
Number of pages	11
Journal	Applied Mathematics and Computation
Volume	232
DOIs	https://doi.org/10.1016/j.amc.2014.01.045
State	Published - 1 Apr 2014

Keywords

Algorithm
Games
Graph theory
Minesweeper
Probability
Strategy

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1016/j.amc.2014.01.045

Cite this

@article{75872cc82766441d9b4d0d87a3234c80,

title = "Minesweeper strategy for one mine",

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",

keywords = "Algorithm, Games, Graph theory, Minesweeper, Probability, Strategy",

author = "Shahar Golan",

year = "2014",

month = apr,

day = "1",

doi = "10.1016/j.amc.2014.01.045",

language = "English",

volume = "232",

pages = "292--302",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Minesweeper strategy for one mine

AU - Golan, Shahar

PY - 2014/4/1

Y1 - 2014/4/1

N2 - 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

AB - 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

KW - Algorithm

KW - Games

KW - Graph theory

KW - Minesweeper

KW - Probability

KW - Strategy

UR - http://www.scopus.com/inward/record.url?scp=84893758279&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2014.01.045

DO - 10.1016/j.amc.2014.01.045

M3 - Article

AN - SCOPUS:84893758279

SN - 0096-3003

VL - 232

SP - 292

EP - 302

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

Minesweeper strategy for one mine

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this