This is JavaScript AI solver that can solve deterministic moves to complete a game of Minesweeper. The game is formulated as a constraint satisfaction problem (CSP) which uses coupled subsets to dynamically create and solve constraints.
The easy difficulty has a board size of 10 x 12 with the probability of 18% that a cell is a mine.
Click on a cell to reveal how many mines (💣) are around that cell. If there is a mine in the cell, you lose the game (💥). A cell can be marked by right clicking on the cell, and will be indicated with a 🚩.