WHY ELIMINATION STALLS
Simple elimination finds cells forced by a single constraint: "the only missing digit in this row is 4, so this cell is 4." That logic resolves each cell in isolation. Hard puzzles are constructed to defeat it — the designer ensures no single cell is forced until you apply multi-cell reasoning.
The four techniques below all share the same underlying logic: two digits or two cells lock each other into a position. Once the lock is identified, candidates in other cells — not the locked pair itself — can be eliminated. The locked cells don't give you their values directly. They give you information about cells nearby.
Learning these techniques doesn't make hard Sudoku easier in the sense of requiring less thinking. It gives you the specific thinking tool for each specific obstruction. Apply the right one and the puzzle breaks open.
NAKED PAIRS
A naked pair is two cells in the same row, column, or box that contain exactly the same two candidates — and nothing else. Say cells A and B in the same row both show candidates {3, 7} and no other possibilities.
You don't know which cell gets 3 and which gets 7. But you know one of them gets 3 and the other gets 7. That means: no other cell in the same row can be 3 or 7. You can eliminate both digits from every other cell in the shared row (and from shared columns or boxes if A and B also share those units).
The critical constraint is “naked” — both digits are the only candidates in both cells. A cell showing {3, 5, 7} is not part of a naked pair with a cell showing {3, 7}. Both cells must carry exactly the two shared digits, nothing more.
Naked pairs are the most common hard-Sudoku technique. If simple elimination stalls, scan each row, column, and box for two cells that share exactly two candidates.
HIDDEN PAIRS — THE HARDER VERSION
Hidden pairs apply the same logic from the opposite direction. Instead of finding two cells with the same two exposed candidates, you look for two digits that appear in exactly the same two cells within a row, column, or box — even though those cells have other candidates too.
If digits 4 and 8 appear as candidates only in cells C and D within a row, then C and D must contain 4 and 8 in some order. Every other candidate in C and D can be eliminated — reduce both cells to {4, 8} only. The pair was hidden among other candidates until you scanned for where those specific digits could go.
Hidden pairs are harder to spot than naked pairs because the critical digits are buried in cells that look like they have many options. The scanning technique: for each digit in a row, column, or box, mark which cells it appears in. If two digits share the same two-cell set, you've found a hidden pair.
BOX-LINE REDUCTION
Also called pointing pairs. The logic: if a digit can only appear in one row (or column) within a 3×3 box, then that digit must land in that row. Because it must land there, it cannot land elsewhere in that row — meaning you can eliminate it from every cell in the row outside the box.
Example: within the top-right box, candidate 6 appears only in cells along the second row. So the 6 for that box must go in the second row. Every other cell showing 6 in the second row — outside the top-right box — can be cleared.
The reverse works too (line-box reduction): if a digit can only appear within one specific box for a given row or column, it can be eliminated from the rest of that box. Both directions are worth checking before moving to X-Wing.
X-WING — WHY IT ACTUALLY WORKS
X-Wing is the technique most guides teach by pattern rather than proof. Here's the proof, because understanding it makes the technique reliable instead of rote.
The setup: a digit appears as a candidate in exactly two cells in row A, and in exactly the same two columns in row B. Four cells form a rectangle. Call them A1, A2 (row A, columns 1 and 2) and B1, B2 (row B, columns 1 and 2).
The constraint: the digit must appear once in row A. It goes in A1 or A2. If it goes in A1, column 1 is covered — so B1 is eliminated, meaning the digit goes in B2. If it goes in A2, column 2 is covered — so B2 is eliminated, meaning the digit goes in B1. Either way, the digit uses column 1 exactly once across the rectangle and column 2 exactly once. That means: no other cell in column 1 or column 2 can hold this digit. Eliminate it from every cell in those two columns except A1, A2, B1, and B2.
The pattern is a rectangle. The proof is that two rows together own two columns for this digit, so nothing outside the rectangle can hold it. Once the proof clicks, the technique is fast to apply.
HOW TO SEQUENCE THESE
In practice: run basic elimination until it stalls. Then scan for naked pairs — they're the most common. Then hidden pairs. Then box-line reduction (it only requires looking at one unit at a time, so it's fast). X-Wing only becomes necessary on the hardest puzzles, and finding it takes scanning multiple rows for the same two-column pattern.
If all four stall: look for naked or hidden triples (the same logic extended to three cells and three digits instead of two). After triples, the puzzle is either rated expert or requires Swordfish (X-Wing extended to three rows and three columns) or harder patterns.
The discipline that actually matters isn't memorising pattern names. It's the refusal to guess. Every hard Sudoku that looks like it requires trial-and-error has a logical next step. The techniques above cover the vast majority of them.