How to read Minesweeper clues and justify your next move

Start with what a number actually tells you

To play Minesweeper, uncover every square that does not contain a mine. An uncovered number counts mines in the squares touching it, including diagonal neighbors. It does not point toward a particular square. A 1 beside three covered squares means one of those neighbors contains a mine; it does not, by itself, identify which neighbor to flag.

Break Club’s main game offers a nine-by-nine Classic board with ten mines and a six-by-six Practice board with five. The winning condition is the same in both. You do not need a flag on every mine to win; you need every safe square uncovered. Keeping those two actions separate makes several confusing situations easier to understand, especially when the flag counter reaches zero before the board is finished.

Why the first click can uncover a whole area

Mines are placed after your first reveal. The selected square and its immediate neighbors are excluded from mine placement. That creates a safe opening in these boards. When an uncovered square has no adjacent mines, connected safe squares open automatically, leaving numbered squares around the boundary. A large opening follows from that rule rather than from a special bonus.

The safe first click does not guarantee a puzzle that can be solved entirely through deduction. Later information may still allow more than one mine arrangement. A safe opening and a no-guess generator are different product features. Before applying advice you found for another Minesweeper version, check whether it assumes a different generator, board size, or opening rule. This guide does not claim that restarting repeatedly proves you have found a logically solvable board.

Compare neighboring clues instead of reading them alone

A useful deduction often comes from the difference between two sets of covered neighbors. Imagine the upper-left corner of a board. The first two squares of the top row are uncovered 1s. Call the next top-row square A, and call the three squares directly beneath that row B, C, and D, from left to right.

The corner 1 touches B and C. Exactly one of those two squares must contain a mine. The next 1 touches B, C, A, and D. It also permits exactly one mine. Because B and C already account for that mine, A and D must be safe. You still cannot tell whether B or C contains it.

The boundary and neighbor lists are essential conditions. Move the same numbers into the middle of a board, add other covered neighbors, or omit a diagonal, and the conclusion may no longer follow. Transfer the reasoning about sets of neighbors, rather than memorizing an image of two adjacent 1s.

Use the 1–2–1 pattern only when its geometry fits

Consider three clues beside exactly three unresolved squares A, B, and C. Suppose the first 1 touches only A and B, the 2 touches A, B, and C, and the final 1 touches only B and C. Their constraints are A+B=1, A+B+C=2, and B+C=1, where a mine counts as one and a safe square as zero.

Subtract the first equation from the middle equation and C must be a mine. Subtract the third from the middle and A must be a mine. The remaining middle square B is safe. This is an explanation of a specific arrangement, not permission to flag the outer squares whenever 1, 2, and 1 appear in a row.

If any clue also touches an unresolved square outside the corridor, include it in the calculation. Subtract already proven adjacent mines from each clue before comparing the remaining unknowns. A flag that you placed on a hunch is not a proven mine and should not silently become a fact in your equations.

A zero flag counter does not verify your flags

The remaining-mine display subtracts the number of flags from the mine total. On a ten-mine board, ten flags make that counter zero whether the flags are correct or not. The counter does not inspect your reasoning or reveal the hidden contents of a flagged square. Moving a flag from a mine to a safe square can leave the displayed total unchanged while making the board less accurate.

A flagged square is protected from an ordinary reveal until you remove the flag. If the counter is zero but the game continues, inspect the covered squares rather than assuming the game failed to recognize a win. Some safe squares may remain hidden, or a mistaken flag may be preventing one from opening. On a phone, use the flagging control deliberately and switch back to revealing before the next intended opening. Desktop right-click can toggle a flag as well.

Recognize uncertainty without inventing a probability

Suppose a lone 1 has two plausible mine locations among its covered neighbors. You can draw one arrangement with a mine in the first location and another with a mine in the second. That demonstrates that the single clue does not distinguish them. It does not establish that they are equally likely or that those are the only arrangements compatible with the whole board.

Other visible clues may eliminate one arrangement. The total remaining mine count can also matter once the relevant possibilities have been considered correctly. Before calling a move forced, ask whether every arrangement satisfying all the information you are using gives that square the same status. If the answer is no, preserve the uncertainty. An honest description of a guess is more useful than a confident label attached to an unsupported flag.

Work outward from a small, checkable boundary

Start with an uncovered number whose covered neighbors you can list comfortably. Count confirmed adjacent mines and then count unresolved neighbors. If all the mines required by that number have already been accounted for, its other neighbors are safe. If every remaining unresolved neighbor is needed to satisfy the number, those neighbors are mines. Check shared clues again after each justified opening.

This approach keeps the amount of information manageable on a phone. You do not have to inspect the whole grid after every click. However, do not ignore a clue merely because it lies outside the small area you first chose. A boundary deduction must remain compatible with the rest of the visible board. If your flags cause a number to have too many adjacent mines, revisit the assumptions that produced those flags before opening additional squares.

Finish by checking safe squares, not by adding flags

Near the end, compare every unresolved area with its surrounding clues. Distinguish an unflagged mine from a safe square that still needs to be opened. Only the second prevents the safe-square winning condition from being met. You can complete a board without using flags at all, although flags may make your own reasoning easier to organize.

The useful question before a reveal is specific: which visible constraints show that this square is safe? Before a flag, ask which constraints require a mine there. If neither explanation is available, do not mistake the counter, a familiar-looking pattern, or the size of your first opening for proof. You can pause the attempt and return to the same problem without turning uncertainty into a promise of a perfect run.

A corner square has three neighbors, an edge square away from a corner has five, and an interior square has eight. That changes the list you must inspect, not the meaning of its number. When a clue seems impossible, count its actual neighbors before revising a flag. Accidentally including a square two steps away, or excluding a diagonal, can create a contradiction that is in your analysis rather than in the generated board.