Sudoku Solving Techniques

Every high-quality puzzle should be solvable by logic alone – no guessing required. This guide covers all the techniques the puzzles on this website can demand, from the singles every solve is built on to advanced techniques. Each one is shown in action on a real puzzle, exactly as the in-game hint would present it: The green cells form the pattern, the orange cells lose candidates, and the struck-through pencil marks are the eliminations. Knowing these techniques, you can solve any puzzle published on this website and other high-quality sources, and you’ll have more fun with the process too.

Foundation – Singles

Every solve starts here. These two steps apply to every puzzle at every difficulty level.

Naked Single

Only one candidate remains in a cell.

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. Most Easy puzzles reduce almost entirely to a sequence of naked singles once you pencil in your candidates.


Naked Single example
R1C2 can only be 9. Every other digit already appears in row 1, column 2, or the top-left box, so 9 is all that's left.
Places 9 in R1C2

Hidden Single

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

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.


Hidden Single example
In row 2, the digit 6 only fits in R2C8. Every other cell there is already blocked by a 6 in its own row, column, or box, so R2C8 must be 6.
Places 6 in R2C8

Easy – Intersections

Easy puzzles are solvable with singles plus these two intersection deductions. Nothing harder is ever required.

Pointing Pair / Triple

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

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.


Pointing Pair / Triple example
In the top-right box, the digit 8 can only sit on row 1 (R1C8, R1C9). So row 1 owns the box's 8, and 8 can be removed from the rest of row 1.
Removes: 8 from R1C5, R1C6

Claiming Pair / Triple

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

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).


Claiming Pair / Triple example
In column 2, the digit 6 can only sit in R5C2, R6C2, all inside the middle-left box. So that box's 6 must fall in column 2, and 6 can be removed from the rest of the middle-left box.
Removes: 6 from R5C1, R5C3, R6C1

Intermediate – Subsets

Naked and hidden subsets are the backbone of intermediate solving. Once you see pairs, triples are just the same idea with one more cell.

Naked Pair

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

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.


Naked Pair example
Between them, R4C4, R5C5 in the center box hold only 3,6. Those digits are locked to those 2 cells, so they can be removed from the rest of the center box.
Removes: 3 from R6C5

Naked Triple

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

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}.


Naked Triple example
Between them, R2C4, R4C4, R9C4 in column 4 hold only 2,6,7. Those digits are locked to those 3 cells, so they can be removed from the rest of column 4.
Removes: 7 from R5C4, R6C4 · 6 from R6C4

Naked Quad

Four cells in a house sharing four candidates between them.

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.


Naked Quad example
Between them, R5C1, R5C3, R5C5, R5C6 in row 5 hold only 2,3,5,7. Those digits are locked to those 4 cells, so they can be removed from the rest of row 5.
Removes: 3 from R5C4, R5C8 · 5 from R5C4 · 7 from R5C4

Hidden Pair

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

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.


Hidden Pair example
In column 2, the digits 3,5 can only go in R5C2, R6C2. That ties up those 2 cells, so any other candidates in them can be removed.
Removes: 9 from R5C2 · 6 from R5C2, R6C2 · 7 from R5C2 · 2 from R6C2

Hidden Triple

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

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.


Hidden Triple example
In row 1, the digits 3,5,9 can only go in R1C3, R1C5, R1C7. That ties up those 3 cells, so any other candidates in them can be removed.
Removes: 2 from R1C5, R1C7 · 4 from R1C5

Hidden Quad

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

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.


Hidden Quad example
In row 1, the digits 3,4,5,9 can only go in R1C3, R1C5, R1C7, R1C8. That ties up those 4 cells, so any other candidates in them can be removed.
Removes: 2 from R1C5, R1C7, R1C8

Expert – Fish, Wings, Chains & Uniqueness

Expert puzzles are guaranteed to need at least three techniques from this tier, including at least one that no intermediate technique can replace.

X-Wing

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

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.


X-Wing example
Rows 6 and 9 each have 4 only in columns 2 and 8. Each row needs one 4, so 4 can be removed from columns 2 and 8 in every other row.
Removes: 4 from R4C2, R4C8

Swordfish

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

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.


Swordfish example
Across rows 1, 2, 7, the digit 2 sits only in columns 3, 6, 9. Those rows fill those columns with their 2s, so 2 can be removed from the rest of columns 3, 6, 9.
Removes: 2 from R3C6, R9C6, R9C9

Jellyfish

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

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.


Jellyfish example
Across rows 1, 3, 4, 8, the digit 3 sits only in columns 3, 4, 5, 6. Those rows fill those columns with their 3s, so 3 can be removed from the rest of columns 3, 4, 5, 6.
Removes: 3 from R2C3, R2C4, R2C5, R6C5, R2C6

Finned X-Wing

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

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.


Finned X-Wing example
Column 4 has 3 only in rows 1 and 4. Column 8 has 3 in those same rows plus fins at R5C8, R6C8. If the fins hold 3 it stays in that box; if not it's a plain X-Wing – either way 3 leaves the rest of row 4 inside that box.
Removes: 3 from R4C9

XY-Wing

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

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.


XY-Wing example
Pivot R8C6 holds {6,8}. One wing R8C1 is {6,2}, the other R7C5 is {8,2}, so whichever the pivot takes, one wing is forced to 2. Any cell that sees both wings can't be 2.
Removes: 2 from R7C1

XYZ-Wing

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

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.


XYZ-Wing example
Pivot R2C3 holds {1,5,8}, with wings R2C6 = {1,8} and R3C1 = {5,8}. One of these three cells must be 8, so any cell that sees all three can't be 8.
Removes: 8 from R2C1

W-Wing

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

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.


W-Wing example
R1C4 and R6C9 both hold only {2,3}, and in row 8 the digit 2 links them. Either way one of the two ends up 3, so any cell that sees both can't be 3.
Removes: 3 from R1C9

Skyscraper

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

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.


Skyscraper example
In rows 5 and 7, the digit 8 fits in only two cells each, and they share column 8. Only one of the two column 8 cells can be 8, so one of the far ends (R5C6 or R7C5) must be 8. Any cell that sees both ends can drop 8.
Removes: 8 from R6C5, R8C6

2-String Kite

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

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.


2-String Kite example
Row 2 has 3 only at R2C5 and R2C7, and column 4 has 3 only at R1C4 and R4C4. R2C5 and R1C4 share the top-center box, so only one of them is 3. That forces one of the far ends (R2C7 or R4C4) to be 3, so any cell that sees both ends can drop 3.
Removes: 3 from R4C7

XY-Chain

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

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.


XY-Chain example
A chain of bivalue cells links R1C4 to R7C7: R1C4R8C4R4C4R4C2R4C6R8C6R9C5R7C5R7C7. Each adjacent pair shares one candidate, so if R1C4 isn't 3 the links force R7C7 to be 3. Either way one end holds 3, so any cell that sees both ends can drop 3.
Removes: 3 from R1C7

Nice Loop (AIC)

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

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.


Nice Loop (AIC) example
This chain alternates strong (≡) and weak (–) links: R2C7=2R2C7=5R2C3=5R1C3=5R1C3=2R1C7=2. Whichever end is true (R2C7=2 or R1C7=2), any candidate that sees both ends can be removed.
Removes: 2 from R2C8, R5C7

Unique Rectangle

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

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.


Unique Rectangle example
R4C8, R4C9, R2C8, R2C9 form a rectangle, with R4C8 and R4C9 holding only {1,3}. In row 2, the digit 3 fits only in R2C8 and R2C9, so one of them is 3. If the other were 1, all four corners would reduce to {1,3} and could swap for a second solution, so remove 1 from both R2C8 and R2C9.
Removes: 1 from R2C8, R2C9

BUG+1

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

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.


BUG+1 example
Every empty cell has two candidates except R1C1, which has three: {6,8,9}. If it dropped to two as well, the puzzle would have a second solution. Only 9 appears an odd number of times across R1C1's row, column, and box, so it must be 9.
Places 9 in R1C1

Forcing Chain

Both branches from a bivalue cell reach the same conclusion.

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.


Forcing Chain example
R7C7 is either 2 or 7. Either way the same eliminations follow: If R7C7 = 2 (chain depth 0): 1. assume R7C7 = 2 → therefore 2 is removed from R9C9 If R7C7 = 7 (chain depth 2): 1. assume R7C7 = 7 2. R2C9 = 7 (only place for 7 in column 9) 3. R9C9 = 6 (only place for 6 in column 9) → therefore R9C9 cannot be 2
Removes: 2 from R9C9

Ready to put them to use? Three new puzzles – Easy, Intermediate, and Expert – are published every day, and the in-game hint button explains the next logical step with the same visuals used on this page.

Play today’s puzzle!