0

We're developing a Minesweeper game. Currently the board is generated randomly and so a large percentage of the games, especially on larger grids, require guessing, i.e. there will be multiple solutions that correspond to some given state of the board, and the players don't like that too much. Is there a good algorithm to use to generate a Minesweeper board that do not require guessing?

The initial board has all cell hiddens, and we made sure the first move is never a bomb. The board generator is triggered only after the first move.

user1615898
  • 1,185
  • 1
  • 10
  • 20
  • 1
    but the first move in minesweeper is always guessing, right? – man zet Dec 31 '19 at 10:59
  • 1
    Please add more information. Does the initial board need to have all cells hidden, or can some (numbers) be revealed at the very start? What are the strategies you have thought of so far? What are the problems with those? – trincot Dec 31 '19 at 11:23
  • @manzet We made sure the first move is never a bomb - this is easy. Generator only starts after the first move is made. – user1615898 Dec 31 '19 at 16:49
  • @trincot Added more information. – user1615898 Dec 31 '19 at 16:50
  • Do you mean that at any point in the game the player can always find one cell whose state is completely determined by the history of the uncovered cells so far? – Juan Carlos Ramirez Dec 31 '19 at 17:14
  • @JuanCarlosRamirez yes , there should be exactly one solution for the game given the uncovered cells – user1615898 Jan 01 '20 at 09:08
  • 4
    Does this answer your question? [Generate a minesweeper board which doesn't need guessing](https://stackoverflow.com/questions/8304982/generate-a-minesweeper-board-which-doesnt-need-guessing) – man zet Jan 01 '20 at 12:23

0 Answers0