←back to thread

Minesweeper thermodynamics

(oscarcunningham.com)
206 points robinhouston | 1 comments | | HN request time: 0s | source
Show context
gregfjohnson ◴[] No.45123258[source]
I hacked up a version of minesweeper that was “forgiving:” if there was no selection that was provably safe, it gave you a safe move. If you picked any square that was not provably a bomb, it would not be a bomb. Typically, as long as you don’t select a number of bombs equal to the number of squares , your first move is safe. I just extended that for the whole game. If you select N-1 bombs, you always win on the first move..
replies(8): >>45123401 #>>45124178 #>>45124382 #>>45124386 #>>45124449 #>>45124938 #>>45126205 #>>45126922 #
Eddy_Viscosity2 ◴[] No.45126205[source]
> a version of minesweeper that was “forgiving:”

I think this diminishes the game. Sometimes you just don't have enough information to know for sure. Experiencing this in a low stakes situation like a minesweeper game reminds us that life is like that sometimes and we just have to make a guess and accept the consequences.

replies(2): >>45128943 #>>45133204 #
1. wkjagt ◴[] No.45133204[source]
I actually like the idea that it's always solvable. Like a sudoku puzzle. If a sudoku isn't solvable through logic, but requires guessing, it's considered an invalid puzzle.