Minesweeper Coach
Free, private browser tool

Minesweeper Solver

Enter your visible board to find the next guaranteed safe move or mine—and see the logic behind it.

  • Guaranteed moves only
  • Proof included
  • Runs locally
Solver workspace

Recreate your board

1. Choose a cell state. Then tap the matching cells on your board. Keyboard: 0–8 for clues, F for flag, X for covered.

2. Recreate the visible cells. Leave everything else covered.

Guaranteed means guaranteed. If the visible clues do not force a move, the solver says so instead of guessing.

Keep practicing

Try today’s no-guess board

Every move can be found with logic. No 50/50 required.

Play today’s challenge
Three steps

How the solver works

  1. Recreate what you see.Choose clues, covered cells, and flags. You do not need to enter hidden information.
  2. Check the constraints.The local solver compares overlapping clue groups and looks for a forced move.
  3. Reveal it in your game.Enter the real number shown after a safe reveal. We never fabricate the next clue.
Read the answer

What each solver result means

Safe to reveal

The cell is safe in every mine placement consistent with the visible clues and flags you entered. Reveal it in your game, then enter the actual clue that appears.

Guaranteed mine

Every consistent placement puts a mine in that cell. Mark it as a flag; do not reveal it.

No forced result

A “No guaranteed move found” result means the implemented deterministic rules cannot force a move from the current input. It does not prove that guessing is the only possible strategy.

Conflicting input

At least one clue, flag, or covered-cell relationship is inconsistent. Compare the entered area with your game before asking for another move.

Proof, not a score

How a guaranteed move is proved

Each revealed number becomes a constraint: the adjacent unknown cells must contain the clue number minus any adjacent flags. A direct constraint can make all remaining cells safe or make all of them mines. When two clue groups overlap and one unknown-cell set is contained in the other, subtracting the smaller constraint can isolate another forced result.

The solver returns one proof-backed move at a time. It does not inspect hidden cells, upload the board, calculate a probability, or turn a likely move into a guarantee.

See the exact rules and worked board proofs →

Deterministic, not predictive

If no certain move follows from the visible clues, the answer says so. This version does not estimate odds or recommend a guess.