How does the 1-2-1 pattern work in Minesweeper?

When a 1-2-1 number sequence borders three unopened squares on a straight wall, the center 2 requires two mines. Because each outer 1 can touch at most one mine among its shared squares, the two outer squares must contain mines, while the center square opposite the 2 is guaranteed safe.

What is the 1-2-2-1 Minesweeper pattern?

Along a four-square flat boundary with the sequence 1-2-2-1, the two squares directly opposite the 2s are mines, while the two squares in front of the 1s are guaranteed safe. This follows from isolating the mine quotas across overlapping two-cell groups.

What is chord clicking (chording) in Minesweeper?

Chording is an efficiency technique where you click both mouse buttons simultaneously (or middle-click / double-tap) on a revealed numbered square that already touches its full quota of flagged mines. The game instantly reveals all remaining adjacent unflagged squares in a single action, drastically lowering overall click counts.

How do you handle unavoidable 50/50 guesses?

Leave ambiguous 50/50 areas for the end of the game. Solving the rest of the board first frequently provides global mine-count information that solves the ambiguity. If a guess remains unavoidable, choose an opening that maximizes new information if safe.

What is effective number reduction?

Effective number reduction means subtracting all known, flagged adjacent mines from a revealed number. For example, a 3 touching one confirmed flag behaves as an effective 2 on all remaining unopened adjacent squares.

Minesweeper Patterns & Advanced Logic Guide

Minesweeper is a deterministic constraint-satisfaction puzzle. Every numbered square states the exact count of hidden mines in its eight adjacent neighbors. On standard boards, over 90% of unopened frontiers resolve through logical deduction rather than blind guessing. Once you recognize recurring number arrangements, you can clear dense clusters in seconds without hesitating.

The Fundamental Principle: Effective Number Reduction

Every pattern in Minesweeper relies on one core calculation: effective value. When a numbered tile touches confirmed, flagged mines, subtract those flags from its visible number. The result is the tile's effective number on all remaining unopened neighbors.

For example, a 3 that already touches one flagged mine functions as an effective 2 against its remaining unopened neighbors. A 2 that touches one flagged mine functions as an effective 1. When two adjacent tiles share overlapping unopened squares, you compare their effective numbers to isolate guaranteed mines and guaranteed safe squares.

Pattern 1: The 1-2-1 Straight Wall

The 1-2-1 configuration is the most famous pattern in the game. It occurs whenever the numbers 1, 2, and 1 appear in a straight line along a flat wall of unopened squares.

┌───┬───┬───┐ │ ? │ ? │ ? │ <-- Unopened row: [A] [B] [C] ├───┼───┼───┤ │ 1 │ 2 │ 1 │ <-- Revealed numbers └───┴───┴───┘ Deduction Result: [A] = MINE 🚩 [B] = SAFE 🟩 [C] = MINE 🚩

Here is why the math works:

The center 2 touches squares A, B, and C, requiring exactly two mines across those three cells.
The left 1 touches only A and B. Because its total quota is one, at most one mine can sit in {A, B}.
Therefore, square C must hold the second mine for the 2.
By identical symmetrical logic on the right 1, square A must hold a mine.
Because A and C both contain mines, the center 2 is completely satisfied. Square B in the middle is guaranteed safe.

Quick Memory Rule: On a flat 1-2-1 wall, the outer squares are mines, and the middle square is safe.

Pattern 2: The 1-2-2-1 Symmetry Rule

When four numbers in sequence read 1 - 2 - 2 - 1 against four unopened squares along an edge, you get a double-mine configuration.

┌───┬───┬───┬───┐ │ ? │ ? │ ? │ ? │ <-- Unopened row: [A] [B] [C] [D] ├───┼───┼───┼───┤ │ 1 │ 2 │ 2 │ 1 │ <-- Revealed numbers └───┴───┴───┴───┘ Deduction Result: [A] = SAFE 🟩 [B] = MINE 🚩 [C] = MINE 🚩 [D] = SAFE 🟩

The step-by-step logic:

The left 1 borders squares A and B. Exactly one mine sits in {A, B}.
The left 2 borders squares A, B, and C. Since {A, B} contains one mine, square C must contain the second mine.
Symmetrically, the right 1 borders C and D, forcing square B to be a mine for the right 2.
Because B is a mine, the left 1 is satisfied, making A safe. Because C is a mine, the right 1 is satisfied, making D safe.

Quick Memory Rule: On a 1-2-2-1 wall, mines sit directly in front of the 2s, and safe squares sit directly in front of the 1s.

Pattern 3: Corner 1-1 and 1-2 Reductions

Corners create sharp constraints because a corner tile touches fewer unopened neighbors than an edge tile.

The 1-1 Corner Pattern

A 1 on a corner touches only two unopened squares (A and B). An adjacent 1 on the open edge touches those same two squares plus a third unopened square (C).

┌───┬───┬───┐ │ ? │ ? │ ? │ <-- [A] [B] [C] ├───┼───┼───┤ │ 1 │ 1 │ │ <-- (Corner 1) (Edge 1) └───┴───┴───┘ Deduction Result: [A, B] = Contains exactly 1 mine [C] = SAFE 🟩 (can be opened immediately)

Because the corner 1 forces one mine into either A or B, that single mine also fulfills the quota for the neighboring 1. Therefore, square C cannot contain a mine and is safe to click.

The 1-2 Corner Pattern

If the adjacent tile is a 2 instead of a 1, the logic flips from safe to mine:

┌───┬───┬───┐ │ ? │ ? │ ? │ <-- [A] [B] [C] ├───┼───┼───┤ │ 1 │ 2 │ │ <-- (Corner 1) (Edge 2) └───┴───┴───┘ Deduction Result: [A, B] = Contains exactly 1 mine [C] = MINE 🚩 (must supply the 2nd mine for the 2)

Pattern 4: 1-3-1 Walls and 1-2-3 Cascades

Dense number arrangements resolve rapidly once you inspect the highest number first.

The 1-3-1 Straight Wall

If a 3 along a flat edge touches only three unopened squares, all three squares are mines by definition. The flanking 1s are instantly satisfied, making all adjacent unopened squares outside the 3's radius completely safe.

The 1-2-3 Cascade

On a flat wall with numbers 1 - 2 - 3 bordering three unopened squares [A] [B] [C]:

The 3 requires mines in all three adjacent unopened slots that it touches.
The square directly opposite the 3 is always a mine.
The placement cascades backwards to satisfy the 2 and clear squares past the 1.

Summary Deduction Cheat Sheet

Pattern Sequence	Wall Context	Mine Locations	Safe Squares
`1 - 2 - 1`	Flat 3-cell wall	Sides (1st & 3rd)	Center (2nd)
`1 - 2 - 2 - 1`	Flat 4-cell wall	Middle (2nd & 3rd)	Ends (1st & 4th)
`1 - 1`	Corner / Edge reduction	Inside shared 2 cells	3rd cell on edge
`1 - 2`	Corner / Edge reduction	3rd cell on edge	Undetermined in corner
`1 - 3 - 1`	Flat 3-cell wall	All 3 wall cells	Cells beyond flanks

Speed Efficiency: Chord Clicking (Chording)

Advanced Minesweeper speedrunners do not click every safe tile individually. They use chord clicking (also called chording) to clear multiple safe squares in a single input.

How Chording Works

When a revealed numbered tile touches exactly as many flagged mines as its number indicates, chording that tile instantly reveals all its remaining unflagged neighbors.

On desktop browsers: Click both left and right mouse buttons simultaneously on the numbered tile, or middle-click it.
On mobile touch screens: Tap a satisfied numbered tile or use the dedicated chord toggle.

Why Chording Lowers Your 3BV Score

In competitive Minesweeper, boards are rated by 3BV (Bechtel's Board Benchmark Value), which measures the minimum number of clicks required to solve the board without flagging. Chording cuts physical actions by 30% to 50% across mid-game sweeps. Instead of making four separate clicks around a satisfied 1, a single chord opens all remaining clear neighbors at once.

The Golden Rule of Chording: Never chord a number based on assumed flags. A misplaced flag turns a chord into an instant game over, opening every surrounding square including the true mine.

When Guessing Is Mathematically Unavoidable

Standard Minesweeper board generation can produce non-deterministic endgames where multiple mine distributions satisfy every visible clue with identical mathematical probability. Common examples include isolated 2×2 corners (the dreaded 50/50) and unbroken perimeter loops.

Rules for Managing Unavoidable Guesses

Defer the guess until the end: Never guess a 50/50 while solvable areas remain open on the board. Clearing the rest of the board provides two advantages: it prevents wasting time on an unwinnable seed, and it updates the global mine counter.
Mine counting in the endgame: If the global counter shows exactly 1 mine remaining, and you have two disconnected ambiguity zones, one zone may require 0 mines, immediately resolving the puzzle.
Compare local vs. global probability: If you must guess between an unopened frontier cell and an untouched interior square, calculate the odds. If a frontier square has a 1-in-2 chance (50%) of being a mine, but the unopened void has 10 mines across 50 tiles (20%), opening the void square offers higher survival odds.
Choose maximum information gain: If you must guess on a cluster, click the cell that touches the most unknown neighbors. If it is safe, its number will immediately unlock surrounding deductions. Clicking an isolated corner square yields little information even if you survive.