Sudoku Techniques

25 logical techniques in 4 tiers, each worked on a real puzzle.

Overview

Every puzzle on Peak Sudoku is solvable by logic alone, without guessing. These are all the techniques its puzzles can require, ordered from the steps every solve uses to the patterns only the hardest puzzles demand.

  1. Tier 1Singles2 techniques
  2. Tier 2Intersections2 techniques
  3. Tier 3Subsets6 techniques
  4. Tier 4Fish, wings, chains & uniqueness15 techniques
Reading the examplesCells forming the patternCells losing candidatesEliminated candidates
Tier 1 · 2 techniques

Singles

Every solve starts here. These two steps apply to every puzzle, however hard it is rated.

Naked Single

Only one candidate remains in a cell.

Guide & practice →

Also called a sole candidate. After eliminating the digits already present in the same row, column, and box, one cell is left with a single option. That digit must go there. Gently rated puzzles reduce almost entirely to a sequence of naked singles once you pencil in your candidates.

Worked example
Every digit except 6 already appears in row 1, column 9 or the top-right box, so R1C9 must be 6.
Places 6 in R1C9

Hidden Single

A digit that can only go in one cell of a house.

Guide & practice →

Look at a row, column, or 3×3 box (any one of these is called a "house") and a single candidate digit. If that digit can only be placed in one cell of the house, it belongs there – even if the cell still shows other candidates. Also known as a unique candidate, hidden singles are the most productive basic step because they hide inside cells that look ambiguous at first glance.

Worked example
In column 8, the digit 9 can only go in R2C8. Every other empty cell in column 8 already sees a 9 in its row or box, so R2C8 must be 9.
Places 9 in R2C8
Tier 2 · 2 techniques

Intersections

The first step beyond looking: what a digit's position inside one box tells you about the row or column it shares.

Pointing Pair / Triple

All candidates for a digit in a box line up in one row or column.

Guide & practice →

Look at a 3×3 box. If every cell that could hold a particular digit sits in the same row (or column), the digit must come from inside the box, so it can be eliminated from every other cell of that row (or column) outside the box. The logic runs outward: box → line. Pointing and claiming are together known as Locked Candidates.

Worked example
In the middle-right box, the digit 7 can only go in R4C9 and R5C9, both in column 9. The box's 7 must be in column 9, so 7 can be removed from the rest of column 9.
Removes: 7 from R7C9, R9C9

Claiming Pair / Triple

All candidates for a digit in a row or column lie in one box.

Guide & practice →

The mirror image of pointing. If every cell in a row (or column) that could hold a digit sits inside the same 3×3 box, the digit must land in one of those cells. Eliminate it from every other cell of that box. The logic runs inward: line → box. Also called box-line reduction (and, with pointing, Locked Candidates).

Worked example
In row 2, the digit 4 can only go in R2C4, R2C5 and R2C6, all three in the top-center box. Row 2's 4 must be in that box, so 4 can be removed from the rest of the top-center box.
Removes: 4 from R1C5, R3C5, R1C6, R3C6, R1C4, R3C4
Tier 3 · 6 techniques

Subsets

The backbone of most solves. Once you can see pairs, triples are the same idea with one more cell.

Naked Pair

Two cells in a house containing exactly the same two candidates.

Guide & practice →

If two cells in the same house each contain only the same two digits {a, b}, those digits must occupy those two cells in some order. Eliminate both a and b from every other cell in the house. The cells do not need to be adjacent. Naked pairs, triples, and quads are collectively called naked (or disjoint) subsets.

Worked example
In row 9, R9C3 and R9C8 hold only {6,8} between them. Those two cells must take those two digits, so 6 and 8 can be removed from the rest of row 9.
Removes: 6 from R9C7

Naked Triple

Three cells in a house whose candidates are drawn from the same three digits.

Guide & practice →

Three cells in a house whose candidates are all subsets of {a, b, c} – each cell can hold any two or all three – together must contain a, b, and c exactly. Eliminate those three digits from the rest of the house. Classic shapes: {ab, ac, bc}, {abc, ab, ac}, {abc, abc, abc}.

Worked example
In column 8, R1C8, R2C8 and R3C8 hold only {1,6,9} between them. Those three cells must take those three digits, so 1, 6 and 9 can be removed from the rest of column 8.
Removes: 9 from R5C8, R6C8, R7C8 · 6 from R5C8, R7C8 · 1 from R7C8

Naked Quad

Four cells in a house sharing four candidates between them.

Guide & practice →

Same idea as a triple, one size up. Four cells whose candidates lie entirely within {a, b, c, d} lock those four digits into those four cells. Eliminate a, b, c, d from the remaining cells of the house.

Worked example
In column 8, R4C8, R5C8, R6C8 and R9C8 hold only {1,3,5,9} between them. Those four cells must take those four digits, so 1, 3, 5 and 9 can be removed from the rest of column 8.
Removes: 3 from R7C8, R1C8 · 5 from R7C8 · 9 from R8C8 · 1 from R8C8, R1C8

Hidden Pair

Two digits in a house that can only go in the same two cells.

Guide & practice →

If two digits each appear as candidates in only the same two cells of a house, those cells must hold those two digits – even if extra candidates are written there. Strike every other candidate from both cells. Hidden pairs, triples, and quads are collectively the hidden subsets.

Worked example
In row 5, the digits 3 and 8 can only go in R5C2 and R5C3. Those two cells must take those two digits, so every other candidate can be removed from them.
Removes: 7 from R5C2, R5C3 · 5 from R5C2 · 1 from R5C2, R5C3 · 4 from R5C2, R5C3 · 2 from R5C2, R5C3

Hidden Triple

Three digits confined to the same three cells of a house.

Guide & practice →

Three digits in a house whose combined candidate positions span exactly three cells must occupy those cells. Remove all other candidates from those three cells. Each digit might only appear in two of the three cells – it is the union that matters.

Worked example
In the bottom-left box, the digits 1, 2 and 7 can only go in R7C1, R8C2 and R8C3. Those three cells must take those three digits, so every other candidate can be removed from them.
Removes: 5 from R7C1 · 6 from R7C1, R8C2, R8C3

Hidden Quad

Four digits confined to the same four cells of a house.

Guide & practice →

Four digits whose only positions in a house are the same four cells must fill those cells. Remove every other candidate from those four cells. Quads are rare but the logic is identical to a hidden pair – just larger.

Worked example
In the center box, the digits 5, 6, 8 and 9 can only go in R4C4, R4C6, R5C4 and R5C6. Those four cells must take those four digits, so every other candidate can be removed from them.
Removes: 1 from R4C4, R5C4 · 3 from R4C6 · 4 from R5C4, R5C6 · 7 from R5C6
Tier 4 · 15 techniques

Fish, wings, chains & uniqueness

Patterns that span the whole grid rather than a single house. The harder a puzzle is rated, the more of these it will demand.

X-Wing

A digit restricted to exactly two cells in two different rows, forming a rectangle.

Guide & practice →

Find two rows where a digit X has only two possible positions, and those positions share the same two columns. The four cells form a rectangle. Whichever diagonal pair holds X, each of the two columns gets exactly one X – so X can be eliminated from all other cells of those columns. The same pattern works with rows and columns swapped. The X-Wing is the smallest "fish"; Swordfish and Jellyfish extend it to three and four lines.

Worked example
In columns 2 and 4, the digit 2 can only go in rows 4 and 8. The two columns take one 2 in each of those rows, so 2 can be removed from the rest of rows 4 and 8.
Removes: 2 from R4C6, R4C5, R8C1, R8C5

Swordfish

The 3-row / 3-column generalisation of an X-Wing.

Guide & practice →

In each of three rows, digit X can only go in cells that together lie in just three columns (a row meets each column once, so that is at most three X-cells per row). Each of those rows still needs an X, and no two of them can sit in the same column, so the three X's land in three different columns – and with only three columns available, they fill all three, one apiece. Those columns are now full of X: it can't appear anywhere else in them, so eliminate X from every other cell of the three columns. The pattern also works with rows and columns swapped. In fish notation this is a 3-fish.

Worked example
In rows 2, 3 and 6, the digit 5 can only go in columns 3, 4 and 8. The three rows take one 5 in each of those columns, so 5 can be removed from the rest of columns 3, 4 and 8.
Removes: 5 from R1C3, R1C4, R5C4, R1C8

Jellyfish

The 4-row / 4-column version of Swordfish.

Guide & practice →

Same counting as a Swordfish, one size up. In each of four rows, digit X can only go in cells that together lie in just four columns (at most four X-cells per row). Each of those rows needs an X, and no two can share a column, so the four X's land in four different columns – and with only four available, they fill all four, one apiece. Those columns are now full of X, so eliminate it from every other cell of the four columns. The same works with rows and columns swapped. Jellyfish – a 4-fish – is the largest fish used here; any 5-row pattern mathematically reduces to a smaller fish.

Worked example
In columns 3, 4, 6 and 8, the digit 1 can only go in rows 3, 7, 8 and 9. The four columns take one 1 in each of those rows, so 1 can be removed from the rest of rows 3, 7, 8 and 9.
Removes: 1 from R3C5, R7C2, R7C5, R8C2, R8C5, R9C5

Finned X-Wing

An X-Wing plus one or two extra candidates (the fin) inside one box.

Guide & practice →

Begin with an almost-complete X-Wing. For digit X, take two parallel lines (two rows or two columns) where X is confined to two cells each, lining up on the same two crossing lines – except one of the base lines has a third spot for X, the fin, tucked into the same box as one of its corners. The fin breaks the clean sweep, so X can't be cleared from a whole crossing line. One cell is still doomed either way: If X avoids the fin you have a true X-Wing and its eliminations hold; if X sits in the fin, it's trapped inside that box. The cell where a crossing line meets the fin's box loses on both branches, so X comes out of it. Finned fish are among the most common expert patterns.

Worked example
In column 8, the digit 7 can only go in rows 5 and 7. Column 6 has the same two plus a fin at R4C6. If the fin is 7, it sees every cell of row 5 in the center box; if not, columns 6 and 8 form an X-Wing on rows 5 and 7. Either way, 7 can be removed from row 5 in the center box.
Removes: 7 from R5C4

XY-Wing

Three bivalue cells {XY}, {XZ}, {YZ} – a hinge and two pincers.

Guide & practice →

Also known as a Y-Wing. Find a hinge cell – also called the pivot – with candidates {X, Y}. Find two pincer cells (the wings) that each see the hinge: one holding {X, Z} and one holding {Y, Z}. Whatever value the hinge takes, one pincer is forced to Z. Any cell that sees both pincers cannot contain Z.

Worked example
The pivot R4C3 holds {5,8}, one wing R9C3 holds {5,6} and the other wing R4C8 holds {6,8}. Whichever digit the pivot takes, one wing must be 6, so 6 can be removed from any cell that sees both wings.
Removes: 6 from R9C8

XYZ-Wing

XY-Wing with a three-candidate hinge {XYZ}.

Guide & practice →

The hinge (pivot) has candidates {X, Y, Z}; the pincers (wings) are {X, Z} and {Y, Z}. The same chain logic applies, but elimination cells must see the hinge and both pincers simultaneously – which makes the scope narrower than a standard XY-Wing.

Worked example
The pivot R8C6 holds {1,3,5}, one wing R8C5 holds {1,3} and the other wing R5C6 holds {1,5}. One of these three cells must be 1, so 1 can be removed from any cell that sees all three.
Removes: 1 from R7C6

W-Wing

Two bivalue cells with identical candidates {X, Y}, bridged by a strong link on one digit.

Guide & practice →

Two cells both holding {X, Y}. A strong link on Y (Y appears in exactly two cells of some house, and one of those cells sees each of the bivalue cells) ensures one bivalue cell must take X. Any cell that sees both bivalue cells cannot contain X.

Worked example
R5C6 and R9C5 both hold only {3,9}. In row 2, the digit 3 can only go in R2C6 and R2C5. If R2C6 is 3, R5C6, which shares column 6 with it, isn't 3; if R2C5 is 3, R9C5, which shares column 5 with it, isn't 3. Either way, one of R5C6 and R9C5 is 9, and 9 can be removed from any cell that sees both.
Removes: 9 from R9C6, R6C5, R4C5

Skyscraper

Two rows (or columns) where a digit has exactly two positions, sharing one column (or row).

Guide & practice →

In two rows, digit X is confined to two cells each, and one cell from each row shares the same column. The shared column is the "base"; the other two cells are the "roof". At least one roof cell must contain X, so any cell that sees both roof cells cannot contain X. The skyscraper is a single-digit chain, one of the Turbot Fish patterns.

Worked example
In columns 6 and 9, the digit 3 can only go in two cells each, and both columns have one in row 4. At most one of those row 4 cells is 3, so R7C6 or R9C9 must be 3, and 3 can be removed from any cell that sees both.
Removes: 3 from R9C5, R7C8

2-String Kite

One strong link on a row and one on a column, sharing a cell in the same box.

Guide & practice →

Also called a Kite or Turbot Fish. Digit X has exactly two candidates in some row and exactly two in some column. One candidate from the row and one from the column share a 3×3 box. The other two cells – one from each string – are the kite tails. Any cell that sees both tails cannot hold X.

Worked example
In row 6, the digit 7 can only go in R6C1 and R6C7; in column 8, only in R4C8 and R7C8. R4C8 and R6C7 share the middle-right box, so at most one of them is 7. So R6C1 or R7C8 must be 7, and 7 can be removed from any cell that sees both.
Removes: 7 from R7C1

XY-Chain

A chain of bivalue cells that forces a digit at both endpoints.

Guide & practice →

Each step in the chain is a bivalue cell. Adjacent cells share one candidate value. Both endpoints share the same outgoing digit X. Whichever endpoint takes a different value, the other forces X somewhere. Any cell that sees both endpoints cannot contain X.

Worked example

Suppose R1C1 is not 2.

  1. Then R1C1 is 9, since only 2 and 9 are left there.
  2. So R5C1 is 3, since it sees R1C1 and only 3 and 9 are left there.
  3. So R8C1 is 2, since it sees R5C1 and only 2 and 3 are left there.
  4. So R8C9 is 8, since it sees R8C1 and only 2 and 8 are left there.
  5. So R8C8 is 3, since it sees R8C9 and only 3 and 8 are left there.
  6. So R9C8 is 1, since it sees R8C8 and only 1 and 3 are left there.
  7. So R2C8 is 8, since it sees R9C8 and only 1 and 8 are left there.
  8. So R2C5 is 2, since it sees R2C8 and only 2 and 8 are left there.

Either R1C1 or R2C5 is 2, so 2 can be removed from any cell that sees both.

Removes: 2 from R2C2

Nice Loop (AIC)

An alternating chain of strong and weak links – open or closed.

Guide & practice →

An Alternating Inference Chain alternates strong links (a digit with only two spots in a house, or a bivalue cell) and weak links (two candidates that can't both be true). An open chain ends on the same digit at both ends and proves at least one end holds it, so that digit can be removed from any cell that sees both ends. A closed loop additionally forces an elimination at every weak link around it. Because the links can switch between digits, Nice Loops generalise single-digit chains and subsume skyscrapers, 2-string kites, and many wing patterns.

Worked example

Suppose R3C1 is not 2.

  1. Then R3C1 is 7, since only 2 and 7 are left there.
  2. So R1C1 is not 7, since column 1 holds just one 7.
  3. So R1C6 is 7, since row 1 has nowhere else for 7.
  4. So R1C6 is not 2, since a cell holds just one digit.
  5. So R3C6 is 2, since column 6 has nowhere else for 2.

Either R3C1 or R3C6 is 2, so 2 can be removed from any cell that sees both.

Removes: 2 from R3C3, R3C9

Unique Rectangle

A pattern that would create two solutions – logic forces it to break.

Guide & practice →

Four cells forming a rectangle across two rows, two columns, and two boxes. If all four held only {X, Y}, the puzzle would have two completions – the "deadly pattern" a unique puzzle forbids. Type 1: When three cells are {X, Y} and the fourth has extras, remove X and Y from that fourth cell. Type 4: When one digit has a strong link along one side of the rectangle, eliminate the other digit from the extra-candidate cells.

Worked example
R3C1, R3C2, R9C1 and R9C2 form a rectangle in two boxes, and three corners hold only {5,6}. If R3C2 were also just {5,6}, the corners could swap their 5 and 6 for a second solution. The puzzle has only one, so 5 and 6 can be removed from R3C2.
Removes: 5 from R3C2 · 6 from R3C2

BUG+1

All unsolved cells are bivalue except one – that cell's odd digit is forced.

Guide & practice →

BUG stands for Bivalue Universal Grimace. If every unsolved cell has exactly two candidates except one cell with three, the grid is one step from a deadly pattern that would permit two solutions. Since the real puzzle has only one, the three-candidate cell must break the pattern: It takes the one of its three digits that appears an odd number of times – three, not twice – across its row, column, and box. The other two candidates would leave the deadly pattern intact.

Worked example
Every empty cell has two candidates except R2C3, which holds {2,8,9}. Of these, only 9 appears an odd number of times in R2C3's row, column and box, so it is the extra candidate. Without it, the board would be a pattern of pairs that never has exactly one solution, so R2C3 must be 9.
Places 9 in R2C3

ALS Chain

Links built from almost-locked sets – N cells sharing N+1 candidates.

Guide & practice →

An Almost Locked Set is a group of N unsolved cells inside one house holding exactly N+1 different candidates between them. A single bivalue cell is the smallest example (one cell, two candidates); three cells sharing four digits is another. Since N cells can only ever hold N digits, exactly one of those N+1 candidates has to be the odd one out. That yields an unusually strong link: rule any single digit out of the set, and every remaining digit is pinned inside it. Chaining these sets together reaches eliminations that no wing, fish or bivalue chain can find, because the links no longer depend on a digit having just two homes in a house. ALS logic is what separates the genuinely hardest puzzles from merely hard ones, and it is the technique most often needed to break an Expert grid open.

Worked example

Almost-locked sets do the work here. A set holding just one more candidate than it has cells must place all but one of those digits, so ruling a digit out of the set pins the rest inside it.

Suppose R6C7 is not 8.

  1. Then R5C8 is 3, since without 8, R5C8 and R6C7 (two cells holding only 3, 4 and 8) must hold both 3 and 4.
  2. So R5C8 is not 4, since a cell holds just one digit.
  3. So 8 sits in R1C8 or R2C8, since without 4, R1C8, R2C8 and R5C8 (three cells holding only 3, 4, 8 and 9) must hold all of 3, 8 and 9.

Either R6C7 is 8 or 8 sits in R1C8 or R2C8, so 8 can be removed from any cell that sees both.

Removes: 8 from R3C7, R1C7

Forcing Chain

Both branches from a bivalue cell reach the same conclusion.

Guide & practice →

Pick a bivalue cell. Trace the logical consequences of each value separately. If both assumptions force the same digit into (or out of) some other cell, that conclusion is certain regardless of which branch is correct. Should be reserved for the absolutely trickiest puzzles, and in all cases kept shallow enough to follow by hand.

Worked example

R8C4 is either 1 or 8, and both lead to the same removals.

Suppose R8C4 is 1.

  1. Then R8C6 is 8, since row 8 has nowhere else for 8.
  2. So R8C6 can't be 5 or 7.

Suppose R8C4 is 8.

  1. Then R8C6 is 1, since row 8 has nowhere else for 1.
  2. So R8C6 can't be 5 or 7.

Either way, 5 and 7 can be removed from R8C6.

Removes: 5 from R8C6 · 7 from R8C6

Ready to put them to use?

Put your skills into practice with today’s puzzle, or explore the archive to play any difficulty level.