The document discusses probabilities related to the minesweeper game. It asks what the probability of a mine is in a marked square after revealing a 1 on the first move, and which next move has the lowest probability of hitting a mine. It also asks the probability of revealing a 0 in marked squares after the first move, and the probability that a cell without a mine is surrounded by 8 mines. Links to minesweeper strategy pages are provided.

1. Given that on the first move the player has revealed a 1 as shown, in each of the two cases
below, what is the probability that there is a mine in the square marked'?': If the player wishes
to minimize the probability of hitting a mine on the next move, which move should the player
choose? If a cell reveals a 0, then this is advantageous to the player, because it means that all
neighboring cells are safe to click on. In each of the three cases below, if the player's first move
is to click on the square marked'?', what is the probability that the cell reveals a 0, given that the
player does not lose on the first move? What is the probability that in at least one place on the
board there is a cell which does not have a mine in it but which is surrounded by 8 mines?
Solution
http://nothings.org/games/minesweeper/ www.minesweeper.info/wiki/Strategy