An interesting site was brought to mine and EWQMinesweeper's attention in the IRC: Solving Minesweeper with Matrices
It explains how minesweeper can be solved using Gaussian elimination and a 'Special Rule' arising from the Boolean nature of the game (in the sense of "square X is a mine or not"). Although there are similar things in the articles section, I think this iteration is of interest as he both derived the method independently, explaining it quite simply on the page, and has implemented the resulting solver in C++ code available through this page.
Anyhow, just thought I'd leave this here . Feel free to discuss what he's done below .
"Solving Minesweeper with Matrices" - robertmassaioli
"Solving Minesweeper with Matrices" - robertmassaioli
The number of minesweeper boards:
Exp: 140055249834355336357264746443955277014822625680974475320364702381803619892657792049596418323789908370400 (1.4e104)
Int: 13115156192346373485000211099954895788134532256 (1.3e46) &
Beg: 18934455246 (1.9e10)
Exp: 140055249834355336357264746443955277014822625680974475320364702381803619892657792049596418323789908370400 (1.4e104)
Int: 13115156192346373485000211099954895788134532256 (1.3e46) &
Beg: 18934455246 (1.9e10)
-
- Site Admin
- Posts: 136
- Joined: Tue Jan 08, 2008 3:33 pm
- Location: UK, Scotland
- Contact: