3 ms·
It would be interesting to built a minesweeper implementation that calculates mine positions dynamically. That way, you could resolve "unsolvable" situations l
by Retr0spectrum 10y ago
It would be interesting to built a minesweeper implementation that calculates mine positions dynamically. That way, you could resolve "unsolvable" situations like this by always favouring the player (or the opposite, if you're feeling evil).
- rtpg 10y agoThere is an OSS version of Minesweeper that does something like this! It would dynamically set the game grid so that you never need to guess. Inversely, if you're guessing, it would make you lose ;) It also included a hexagonal grid mode and other goodies, but I haven't touched it in 10 years and can't find it anymore. Might have been windows only, not sure
- Retr0spectrum 10y agoI found this: http://www.chiark.greenend.org.uk/%7Esgtatham/puzzles/js/mines.html http://www.chiark.greenend.org.uk/%7Esgtatham/puzzles/js/min... "you are guaranteed to be able to solve the whole grid by deduction rather than guesswork."
- aardvark179 10y agoYes, and Simon's version delays generation of the grid till your first click to guarantee this.