Advanced Sudoku Techniques: Naked Pairs, X-Wings and Pointing Pairs

Prerequisites: Accurate Pencil Marks

Naked Pairs and Naked Triples

Hidden Pairs and Hidden Triples

Pointing Pairs (Box-Line Reduction)

Unique Rectangle

When to Stop and Use the Solver

How to scan for naked pairs efficiently

Box-line reduction (the inverse)

How to spot X-Wings

When basic scanning and singles don't break through, these intermediate and advanced techniques unlock the stuck positions in hard and expert Sudoku puzzles.

All advanced Sudoku techniques operate on pencil marks — the small candidate digits written in each empty cell showing all remaining possibilities. Before applying any technique in this guide, ensure your pencil marks are complete and accurate: every cell should contain exactly the candidates that are still possible given the current state of all placed digits. One incorrect or missing pencil mark corrupts every technique that follows.

Develop the habit of updating pencil marks immediately after every placement. When you place a digit, remove it from all empty cells in the same row, column, and box before doing anything else. This discipline is what separates reliable advanced solving from frustrated guessing.

A naked pair: two cells in the same unit (row, column, or box) containing exactly the same two candidates and no others. Those two digits must occupy those two cells — therefore, both digits can be eliminated from all other cells in that unit.

Example: cells A and B in the same row both contain only 3, 7'}. Neither 3 nor 7 can appear anywhere else in that row. Remove 3 and 7 from all other cells in that row. This elimination frequently creates hidden singles or naked singles in the affected cells, cascading into further progress.

A naked triple extends the concept: three cells in a unit collectively containing exactly three candidates (distributed among the three cells, but together totaling exactly three distinct digits). The candidates don't need to appear in all three cells — 1,2'}, 2,3'}, 1,3'} in three cells of the same unit form a naked triple for 1,2,3'}. All three digits can be eliminated from all other cells in the unit. Naked triples appear frequently in hard puzzles and require careful pattern recognition to spot.

Look through each unit (row, column, box) for cells with exactly two candidates. When you find one, check whether any other cell in the same unit has exactly the same two candidates. If yes, you have a naked pair. For naked triples, look for three cells whose combined candidates total exactly three distinct digits — this requires more attention but the pattern is present in most hard puzzles.

The complement of naked pairs: two digits that can only appear in exactly two cells within a unit, even though those cells have additional candidates. Those two digits must go in those two cells, meaning all other candidates in those cells can be eliminated. Hidden pairs are often harder to spot than naked pairs because the pairs are obscured by additional candidates in each cell.

Example: in a row, digits 4 and 9 each appear as candidates in only cells C and D. Both 4 and 9 must go in C and D. Therefore, all candidates other than 4 and 9 can be removed from both C and D. The resulting naked pair for 4,9'} then allows further eliminations in the row.

Hidden triples follow the same logic: three digits that appear as candidates only within three specific cells of a unit. All other candidates can be removed from those three cells. Hidden triples are relatively rare but powerful when found.

When all candidates for a digit within a box lie on the same row or column, that digit can be eliminated from the rest of that row or column outside the box. The logic: the digit must go somewhere in the box, and since all possible positions are in the same row (or column), the digit must be in that row within the box — which means it cannot be in that row outside the box.

Example: in the top-left box, digit 5 can only go in the top row (based on column eliminations). Therefore, digit 5 cannot go in any other cell in that row outside the top-left box. Remove 5 from all cells in the top row that are in the top-center and top-right boxes. Pointing pairs are extremely common in medium-difficulty puzzles and essential to master before moving to harder techniques.

The inverse applies equally: when all candidates for a digit within a row or column that intersect a specific box lie within that box, the digit can be eliminated from the rest of the box. If digit 7 in a row can only go in cells that are within the center box, then 7 cannot go anywhere else in the center box. This "box-line reduction" technique is the mirror image of pointing pairs and equally powerful.

An X-Wing pattern: a digit appears as a candidate in exactly two cells in each of two different rows, and those cells align in exactly the same two columns. The digit must go in one of the two columns for each row. This creates a logical chain: in column 1, the digit goes in either row A or row B; in column 2, it goes in whichever row the first column doesn't. This means the digit cannot go anywhere else in either column.

Result: eliminate the digit from all other cells in both columns. X-Wings are the gateway to advanced Sudoku — once you can spot them reliably, "hard" rated puzzles become consistently solvable. The pattern also works with columns instead of rows: two columns where a digit appears in exactly two cells, aligned in the same two rows.

Scan each digit 1-9 looking for rows (or columns) where that digit appears as a candidate in exactly two cells. When you find two such rows for the same digit, check whether the two cells in each row are in the same columns. If yes — X-Wing found. The name comes from the X-shaped pattern the four cells form on the grid. Many Sudoku players find X-Wings most easily by scanning from candidate markup: highlight a single digit across the entire grid, then look for rows with exactly two candidates that share columns.

Swordfish extends the X-Wing concept to three rows (or columns). A digit appears as a candidate in exactly two or three cells in each of three different rows, and all those cells are confined to the same three columns. The digit can be eliminated from all other cells in those three columns — regardless of whether it appears in all three cells in each row, or just two of the three.

Swordfish patterns are rarer than X-Wings but unlock otherwise impossible expert puzzles. The logic is identical to X-Wing but with a 3×3 cell pattern instead of a 2×2 one. Finding Swordfish manually requires careful grid-wide candidate analysis; most solvers who reach this level use colored pencil marks or digital assistance to highlight single-digit candidates across the entire grid.

A technique based on the constraint that a valid Sudoku has exactly one solution. If eliminating a candidate would leave a 2×2 arrangement of four cells in two rows and two columns with only two candidates each — all the same two candidates — two solutions would become possible (swapping the two digits between rows), violating the unique solution constraint. This means you can use this configuration to make deductions that pure elimination logic alone cannot make.

The Unique Rectangle technique is controversial among Sudoku purists who believe valid solving should work purely from constraint logic. However, it's widely accepted in practical solving because the uniqueness constraint is built into every published Sudoku puzzle by definition. Using it doesn't introduce guessing — it uses a valid guaranteed property of the puzzle.

Expert Sudoku puzzles sometimes require techniques beyond what this guide covers: bifurcation (systematic trial and error with backtracking), coloring (multi-color chaining), and forcing chains. These techniques are mathematically valid but extremely time-consuming to apply manually. When you've applied pointing pairs, naked/hidden pairs, X-Wings, and Swordfish and the puzzle is still stuck, using PuzzleUnlock's solver to complete the puzzle or to verify a partial solution is entirely reasonable. The solver uses backtracking with constraint propagation and solves any valid Sudoku instantly.

Stuck on a hard or expert Sudoku?