![]() Thus, if there is no guaranteed-safe cell, we can still determine the least-likely cells to have mines, and play the game quite skillfully.Īny algorithm that hopes to exhaustively solve minesweeper must employ this basic concept: determine all possible placements of mines on the board (and the relative likelihoods thereof), and observe how often each cell has a mine in it. If, among all possible configurations, a cell is always a mine or always clear, we know for certain the cell is a mine or safe.Ī cell that appears in both states cannot be determined with any certainty however, we can compute its relative safety by counting how many configurations in which it appears empty, as a proportion of all possible configurations, assuming all configurations are equally likely. Our goal is to find configurations of mines that satisfy the given constraints. It achieves this through advanced combinatorial and probability analysis.Ī minesweeper board is essentially a set of logical constraints.Įach cell is a boolean state: mine or clear.Įach uncovered cell says how many of the adjacent cells are mines. It can solve any board, with any topology, and exactly compute every cell's chance of being a mine.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |