Minesweeper 1-2-1 Pattern: When to Flag—and When Not To

In the standard Minesweeper 1-2-1 pattern, the two outer covered squares are mines and the middle covered square is safe. But that shortcut needs the right layout: the three clues must face the same row of covered squares, with their other neighboring squares already accounted for. Seeing the digits alone is not permission to place two flags.

The useful skill is checking which squares each clue actually counts. Here is a small example you can verify yourself, followed by a look-alike where the outer flags would be a mistake.

What is the 1/2-1 rule in Minesweeper?

Use these symbols: ? is covered, M is a mine, and S is safe. Letters name squares, not clues. A clue counts mines in all adjacent squares, including diagonals.

Start with three covered squares directly above three revealed clues:

Covered:   A B C
Clues:     1 2 1

For this first example, every other neighbor of those clues is revealed and safe, or outside the board. There are no additional mines already touching the clues. The left 1 touches A and B; the 2 touches A, B and C; the right 1 touches B and C.

The answer is:

Result:    M S M
Clues:     1 2 1

Flag A and C if you use flags, and open B. A safe square is not necessarily a blank square: opening B may reveal another number.

Why the middle square is safe

Suppose B were a mine. It would satisfy both outer 1s, making A and C safe. But then the middle 2 would touch only one mine. That contradiction rules out a mine at B.

With B safe, the left 1 forces A to be a mine and the right 1 forces C to be a mine. The middle 2 now has exactly its two mines.

You can also write the three constraints, using 1 for a mine and 0 for a safe square:

A + B     = 1
A + B + C = 2
    B + C = 1

Subtract the first equation from the second: C must be 1. Subtract the third from the second: A must be 1. Either outer equation then makes B equal to 0.

This is a proof, not a claim that one square is merely less risky.

Check all eight possibilities

For three covered squares there are eight possible mine-or-safe arrangements. This table lists the clue totals each arrangement would produce in the exact layout above.

Only M S M survives. To reproduce the check, sketch each row on paper and count the neighbors of each clue. These are constructed examples, checked by exhaustive enumeration, not screenshots from a randomly generated game or evidence of a win rate.

The look-alike: covered squares on both sides

Now keep the same clues but add another row of covered squares below them:

Covered:   A B C
Clues:     1 2 1
Covered:   D E F

All other neighboring positions are again safe or outside the board. The constraints change:

A + B + D + E         = 1
A + B + C + D + E + F = 2
    B + C + E + F     = 1

There are four arrangements consistent with these three clues:

Notice the important distinction: B and E are safe in every arrangement, but A and C are not always mines. There is exactly one mine in the pair A/D and exactly one in C/F. Other clues elsewhere might resolve those pairs; these three clues alone do not.

The lesson is not “ignore every 1-2-1 unless it touches a physical wall.” It is “preserve the neighbor relationships before copying the flags.” A revealed boundary can be just as useful as a board edge. A second covered side changes what you can conclude.

Subtract confirmed mines before recognizing the pattern

A displayed clue includes every adjacent mine, even one you have already identified. For pattern recognition, calculate:

Remaining mines = displayed clue minus confirmed adjacent mines.

For example, displayed clues 2 3 2 can reduce to 1 2 1 if each touches exactly one confirmed mine outside the three candidate squares. If the remaining unknown neighbors have the first example's shape, the same M S M conclusion follows.

Do the subtraction separately for each clue. One confirmed mine may touch several clues; another may touch only one. Do not subtract every nearby flag from every number.

A flag records your belief. It does not prove a mine is there. If a flag was a guess, using it as a confirmed mine can make all subsequent deductions wrong. Undo uncertain assumptions before relying on a reduced pattern.

A reliable check before your next click

1. Find three consecutive clues in a straight line. Rotate the diagram mentally if they run vertically.
2. List every covered neighbor of each clue, including diagonals and the opposite side.
3. Subtract only mines you have independently established.
4. Compare the remaining neighbor sets with the three-square example. If they differ, reason from the actual sets instead of copying its flags.
5. Identify a square that has the same status in every arrangement consistent with the clues.
6. Open a proven-safe square, then recheck the newly revealed information.

Do not rush into a chord action—opening neighboring squares together—on the strength of unverified flags. Controls differ between games, and a misplaced flag can turn a bulk reveal into a loss.

Common mistakes that break the shortcut

Reading only horizontally. Diagonal neighbors count too. A covered square just beyond the part of the board you were concentrating on can change an equation.

Treating “safe” as “zero.” A safe square cannot contain a mine, but it may show any clue permitted by its own surroundings.

Copying the result across a corner. Rotating a straight boundary preserves adjacency. Bending the clue line around a corner does not automatically preserve it.

Assuming a solvable local pattern makes the whole board guess-free. This deduction settles the squares it constrains. It says nothing about a disconnected region or a later position with several remaining possibilities.

Calling the four look-alike arrangements equally likely. They are possibilities, not a probability calculation. Additional clues and the board's remaining mine count may rule some out.

Does the pattern work in browser Minesweeper?

The reasoning applies to a square-grid game using standard eight-neighbor clues. It does not depend on whether you play in a browser or an installed app. A variant with different adjacency, moving mines, or special clue rules needs separate reasoning.

For practice, visit Classic Minesweeper on Malaguo, check its instructions, and look for a boundary you can explain before you click. This guide does not promise that a particular generated board will contain the pattern or be solvable without guessing.

If you enjoy proving a move instead of guessing, the Nonogram overlap walkthrough uses a different puzzle rule but the same useful habit: keep only what all valid arrangements agree on. You can also try Malaguo's daily logic challenge for a different kind of practice.

The pattern names are established Minesweeper terminology. Minesweeper Online's pattern reference illustrates the standard 1-2-1 and reduction techniques. The explicit eight-case check and two-sided counterexample above are worked constructions for this guide.