You're staring at a wall of grey cells and a row of little numbers, and the honest truth is you're about to guess. You can feel it. Most boards reach a point where it looks like luck — and most of the time, it isn't. The number you need to break the tie is already sitting on the board; you just haven't learned to read it yet.
So let's read it. There are three patterns that turn most of those "I guess I'll guess" moments into flat certainty.
Short answer: Most of Minesweeper is solved by three edge patterns. The 1-1 pattern tells you a cell is safe; the 1-2-1 pattern locks the mines under the two outer numbers; and the 1-2-2-1 pattern puts the mines under the two inner numbers. Learn to spot these three along a wall of hidden cells and you'll clear whole stretches on sight, without re-deriving the logic and without guessing. Below we work through each one cell by cell, then show — from our own source code — how the safe first click is actually built.
We build a Minesweeper-style puzzle (Mines), so the patterns below aren't copied off some other site — they're the exact reasoning our game rewards, and the implementation details near the end come straight out of our own code.
A note on notation
Every pattern below lives on a frontier: a straight run of revealed number cells with a row of unopened cells along one edge. We'll label the hidden cells A, B, C, D from left to right, and read the numbers sitting just below (or beside) them. A flag means "proven mine"; "safe" means "proven not a mine." Nothing here is a hunch — every conclusion falls straight out of the numbers.
The 1-1 pattern: the safe-cell finder
This is the simplest and most common deduction on the board, and most players already use it without ever naming it.
Picture a revealed 1 whose hidden neighbors are A and B. Right next to it, a second revealed 1 whose hidden neighbors are B and C.
hidden: A B C
number: 1 1
Reason it out:
- The left 1 says exactly one mine sits among
{A, B}. - The right 1 says exactly one mine sits among
{B, C}. - Here's the move: whatever is true about
B, both numbers are already satisfied byBplus at most one of the outer cells. The right1only touchesBandC— so ifBis the mine,Cis safe; and ifBis not the mine, thenCmust be the mine to satisfy the right1… but then the left1's mine isA.
The reliable conclusion comes when the run continues. The canonical 1-1 rule is: when a 1 gains a new hidden neighbor that the previous 1 didn't touch, that new cell is safe. Concretely, if the left 1 touches only {A, B} and the right 1 touches {B, C}, then C — the cell the left 1 can't reach — is safe, because the right 1's single mine is already accounted for by the shared cell B whenever the pattern extends along a wall.
1's single mine is covered by the shared cell B, so C — the only cell the left 1 can't touch — is provably safe.The practical habit: walk along any wall of 1s and clear the cell each 1 reaches that its neighbor doesn't. It opens the board fast, and it never once costs you a mine.
The 1-2-1 pattern: mines under the outer numbers
This is the pattern worth memorizing first, because it resolves completely — it tells you exactly where two mines are and exactly which cells are safe, with zero ambiguity left over.
Picture three revealed numbers in a row — 1, 2, 1 — along the bottom, with three hidden cells A, B, C directly above them:
hidden: A B C
number: 1 2 1
Work it one number at a time:
- The middle 2 touches
A,B, andC. So two of those three cells are mines. - The left 1 touches only
AandB(it's at the end of the wall, so there's nothing to its left). So exactly one of{A, B}is a mine. - The right 1 touches only
BandC. So exactly one of{B, C}is a mine.
Now combine, and let it back you into a contradiction. The 2 needs two mines among A, B, C. Suppose B were a mine. Then the left 1 is satisfied by B, so A is safe — and the right 1 is satisfied by B, so C is safe. That leaves B as the only mine among the three… but the 2 demanded two. Contradiction. So B is not a mine — B is safe.
With B safe, the 2 has to pull both its mines from A and C. A and C are both mines — and it squares up: the left 1 gets its mine from A, the right 1 from C. Nobody's guessing.
1-2-1 resolves to: flag
A, flagC, clearB. Mines under the outer ones, safe under the middle.
2 forces both its mines onto A and C, leaving B provably safe. Flag A, flag C, clear B.Once you've seen it a few times you stop deriving it and just read it — a 1-2-1 along a wall is two flags and a safe cell, no thought required.
The 1-2-2-1 pattern: mines under the inner numbers
The natural follow-up, and the mirror image. Four numbers in a row — 1, 2, 2, 1 — with four hidden cells A, B, C, D above them:
hidden: A B C D
number: 1 2 2 1
Step through it:
- The left 1 touches
AandB: one mine in{A, B}. - The left 2 touches
A,B,C: two mines in{A, B, C}. - Subtract: the left
2needs two mines in{A, B, C}, the left1needs one in{A, B}. The difference forcesCto be a mine — the extra mine the2requires, beyond what the1already accounts for, has nowhere to land except the one cell only the2can reach. - By the mirror-image logic on the right — the right 1 touches
{C, D}, the right 2 touches{B, C, D}— the same subtraction forcesBto be a mine. - Now
BandCare both mines. The left1only touches{A, B}and already has its mine inB, soAis safe. The right1only touches{C, D}and already has its mine inC, soDis safe.
1-2-2-1 resolves to: flag
B, flagC, clearA, clearD. Mines under the two inner numbers, safe under the outer ones — the exact opposite of 1-2-1.
B and C, so the outer cells A and D are both safe — the exact mirror of 1-2-1.The trick powering both 1-2-1 and 1-2-2-1 is the same one: set subtraction. When two numbers share hidden neighbors, the gap between their counts pins down a mine — or a safe cell — in the cells they don't share. Once that clicks, you'll start seeing these patterns everywhere along the frontier, and the board stops feeling like luck.
Is the first click in Minesweeper always safe?
In our game, yes — guaranteed — and here's how it's actually built, since we wrote it.
The mines aren't placed when the board is created. They're placed after your first click, and the placement routine deliberately carves out a safe zone around wherever you tapped:
- It builds a set of forbidden indices: the clicked cell plus all eight of its neighbors.
- It then shuffles the rest and drops the mines only into cells outside that safe zone.
So your first click isn't just never-a-mine — its entire 3×3 neighborhood is mine-free, which means your opening tap reliably flood-fills a useful chunk of board instead of revealing a single lonely 8 and leaving you stranded. You start every game with real information, not a coin flip.
That detail is why the patterns above are worth learning. Because the opening is guaranteed to hand you a workable frontier, the game is a deduction puzzle from move one — the patterns do the work, not luck.
A related implementation note: the chord click (revealing all neighbors of a number once its flags match its count) is built right into the engine, and so is the win condition — you win by revealing every non-mine cell, not by flagging every mine. Flags are your notes. Opening safe cells is what actually wins.
When you genuinely have to guess (the 50/50)
Patterns won't save you every time. Once in a while a board leaves a true 50/50 — two cells, exactly one mine between them, and no number anywhere on the board able to break the tie. It usually shows up late, tucked into a corner or jammed against a wall, where there simply aren't enough surrounding numbers to constrain it.
How to handle it:
- Exhaust the logic first. The overwhelming majority of "I have to guess" moments are missed deductions — a 1-1 you didn't extend, a set-subtraction you didn't make, a global mine count you ignored. The board wasn't unfair. You blinked.
- Use the global count near the end. When only a few hidden cells remain, the total mines left versus cells left can force the whole finish. Sometimes every remaining cell is a mine; sometimes every one is safe. Stop solving locally and count.
- If it's truly a coin flip, guess where it costs least. Prefer the cell that, if safe, opens the most new information, and lean toward corners and walls where fewer constraints apply.
Mine density is what makes these guesses rarer or more frequent, and it scales with difficulty. Across our three boards:
| Board | Grid | Mines | Density |
|---|---|---|---|
| Beginner | 9×9 | 10 | 12.3% |
| Intermediate | 16×16 | 40 | 15.6% |
| Expert | 16×30 | 99 | 20.6% |
(Those figures are the mine count divided by total cells, straight from the game's difficulty table.) The jump from 12.3% on Beginner to 20.6% on Expert is exactly why Expert produces those dense, tangled frontiers — more mines crammed into the same space means more numbers pressed together, more pattern-reading per square inch, and more chances for a genuine 50/50 to surface. The patterns above are how you keep all that density solvable instead of overwhelming.
Want to drill them? Open Mines on Beginner, find a wall of 1s and a 1-2-1, and clear them on sight until your eyes start doing it for you. And if you're more interested in the timing side of our games, we pulled the real millisecond windows out of the source in the real numbers behind our reflex games.
FAQ
What are the most important Minesweeper patterns to learn?
The 1-1, 1-2-1, and 1-2-2-1 along a wall of hidden cells. The 1-1 finds a guaranteed safe cell; the 1-2-1 puts mines under the two outer numbers and a safe cell under the middle; the 1-2-2-1 puts mines under the two inner numbers and safe cells under the outer ones. Together they resolve most of a typical board without guessing — and they all run on the same underlying trick: subtracting two overlapping numbers to pin down the cells they don't share.
Is the first click in Minesweeper always safe?
In our game, always — and not just the clicked cell. The mines are placed only after your first tap, and the placement explicitly excludes the clicked cell plus all eight of its neighbors, so your opening move can never detonate and reliably opens a useful starting area. Some older or barebones versions only protect the single clicked cell (or don't protect it at all), but the modern, fair behavior — which we implement — guards the full 3×3 neighborhood.
Can you really play Minesweeper with no guessing?
Almost always, yes — especially with a guaranteed safe first click to get you started. The vast majority of boards are fully solvable by logic using the patterns above plus global mine-count reasoning at the end. Genuine 50/50s do happen — usually late, in a corner, where too few numbers surround the cells to break the tie — but they're rare, and most "forced guesses" are really deductions a player missed.