The standard 1-2-2-1 pattern places mines in the two middle covered squares and leaves the outer two safe. That result is certain only when the complete unknown-neighbor sets match the pattern. Here is an original example you can reconstruct from the clues instead of relying on the shape alone.

Build a four-cell frontier

Imagine four revealed clues along the bottom edge of a board. Directly above them are covered squares A, B, C and D. All other squares adjacent to these clues are revealed safe or outside the board. In particular, the diagonal squares beyond the left and right ends are revealed safe. There are no adjacent known mines in this example.

The left 1 sees A and B. The left 2 sees A, B and C. The right 2 sees B, C and D. The right 1 sees C and D. Those are the complete covered-neighbor sets, not a selection of convenient neighbors. This fragment is a teaching example, not today’s Daily board.

ABCD1221
Four covered squares above a 1-2-2-1 frontier. With the stated complete boundary, B and C are mines; A and D are safe.

Prove the middle mines step by step

  1. The left 1 requires exactly one mine among A and B.
  2. The neighboring left 2 requires two mines among A, B and C. A and B supply exactly one, so C must be the second mine.
  3. The right 1 requires exactly one mine among C and D. C is already a mine, so D is safe.
  4. The right 2 requires two mines among B, C and D. With C mined and D safe, B must be the other mine.
  5. The left 1 is satisfied by B. A is therefore safe.

Represent each cell by 1 for a mine or 0 for safe. The clues give A + B = 1; A + B + C = 2; B + C + D = 2; C + D = 1. Subtracting the first equation from the second proves C = 1. Subtracting the fourth from the third proves B = 1. Both end equations then force A = D = 0. The unique assignment is safe, mine, mine, safe.

How this differs from 1-2-1

In a matching 1-2-1 frontier, the two outer covered squares are mines and the middle is safe. In this four-cell pattern, the middle pair are mines. Do not transfer the result from one diagram to the other: reconstruct the covered-neighbor sets first.

Both arguments use overlapping constraints. One clue’s known mine requirement is contained in another clue’s neighborhood, leaving a forced mine in the difference. Review Minesweeper Basic Patterns if counting a satisfied clue or checking a subset still feels unfamiliar.

Check flags and extra diagonals

A printed clue is the total count of adjacent mines. Subtract only proven adjacent mines to obtain the remaining requirement. A printed 2 beside one proven mine has a remaining requirement of 1, so it cannot be used as an unchanged 2 in this example. The same proof works for reduced requirements of 1, 2, 2, 1 only when the remaining unknown-neighbor sets also match.

An extra covered square X touching the left 1 changes its equation to X + A + B = 1. The original proof no longer establishes A + B = 1. A flag you placed as a guess does not remove this uncertainty. Extra covered squares that touch none of these four clues do not affect these equations; adjacency is what matters.

A practical scan-and-clear routine

  1. Scan straight frontiers for four consecutive clues. Count all eight possible neighbors of each clue, including the end diagonals.
  2. Separate proven mines from covered possibilities. Confirm the remaining requirements and the four complete neighbor sets.
  3. Explain why each middle square is forced. If you cannot reproduce the proof, pause and recheck the boundary.
  4. Flag B and C, then reveal A and D as single safe squares. A chord is appropriate only when every supporting flag is correct.
  5. Revisit nearby clues after the reveals. A new number can unlock an ordinary satisfied-clue move before another long pattern is needed.

See How to Play Minesweeper for flag mode, keyboard controls and chording. The deduction works when the entire neighborhood is rotated or reflected, because those transformations preserve adjacency.

Common mistakes

  • Flagging the outer squares from memory of 1-2-1. Here the two middle squares are mined.
  • Checking only squares directly above the numbers. A covered diagonal beyond either end can invalidate the assumed equations.
  • Subtracting an unproven flag or forgetting a proven mine beside a clue.
  • Using the total mine counter to replace local reasoning. The proof here depends on the four neighborhoods, not a guessed global distribution.
  • Assuming recognizing the pattern guarantees a win. Other parts of the board may still contain uncertainty.

Frequently asked questions

Must the clues sit on the board edge?

No. Revealed safe squares can supply the same boundary. The example uses the bottom edge to make the omitted neighbors explicit; the complete covered-neighbor sets determine whether the deduction applies.

Can I use the pattern vertically?

Yes. Rotate the clues, the covered frontier and its boundary together. The two middle frontier cells remain mines under the same assumptions.

What if just one end has an extra covered neighbor?

Do not apply the full memorized result. Some deductions may still follow from unaffected clues, but you must derive them from the actual neighbor sets. A similar-looking frontier is not proof of four certain outcomes.

Practice explaining all four squares

Open Minesweeper and look for a frontier you can justify with complete counts. Visit Daily Challenges for today’s shared puzzle. This article contains no Daily seed or solution.