Index of Solving Techniques

These are some of the techniques that can be used to solve Sudoku puzzles. They're listed in roughly increasing order of complexity - from the simple and obvious, to the advanced and complex. Many published sudokus won't require any technique beyond hidden subsets, but the more advanced techniques are often useful against the very hardest puzzles.

See the glossary for a brief explanation of the terms used.

Naked Single (Singleton, Sole Candidate)

It is often the case that a cell can only possibly take a single value, when the contents of the other cells in the same row, column and block are considered. Read more with examples »

Hidden Single (Unique Candidate)

If a cell is the only one in a row, column or block that can take a particular value, then it must have that value. Read more with examples »

With the notable exception of forcing chains, the remaining techniques are all about reducing the number of candidates for cells. The aim being to reduce the candidates to such an extent that the first two techniques can be used.

Block and Column / Row Interactions (Pointing Pair)

Sometimes, when you examine a block, you can determine that a certain number must be in a specific row or column, even though you cannot determine exactly which cell in that row or column. Read more with examples »

Block / Block Interactions

If a number appears as candidates for two cells in two different blocks, but both cells are in the same column or row, it is possible to remove that number as a candidate for other cells in that column or row. Read more with examples »

Naked Pair, Triplet, Quad (Locked Set, Naked Subset, Disjoint Subset)

If two cells in the same row, column or block have only the same two candidates, then those candidates can be removed from other cells in that row, column or block. This technique can also be extended to cover more than two cells. Read more with examples »

Hidden Pair, Triplet, Quad (Hidden Subset, Unique Subset)

This technique is very similar to naked subsets, but instead of affecting other cells with the same row, column or block, candidates are eliminated from the cells that hold the hidden subset. Read more with examples »

X-Wing

This is another method of reducing the candidates when two rows have the same candidate only in the same two columns. Read more with examples »

Swordfish

Swordfish is on the same principle as X-wings, but extended to three columns or rows. Read more with examples »

XY-Wing

This is similar to a short forcing chain with only two links for each candidate. Read more with examples »

XYZ-Wing

This is a variation of an XY-wing. Read more with examples »

Colouring

Colouring considers cells where a particular candidate occurs for only two cells in a unit. Read more with examples »

Remote Pairs

This technique is a combination of naked pairs and colouring. Read more with examples »

XY-Chain

XY chains allow you to make eliminations by following a chain of cells that have only two candidates each. Read more with examples »

Forcing Chains

Forcing chains is a technique that allows you to deduce with certainty the content of a cell from considering the implications resulting from the placement of each of another cell's candidates. Read more with examples »

Trial and Error

There are some that would argue trial and error is not a logical technique, and is no better than guessing. When further moves seem impossible, trial and error may be the only way forward. Read more »

Other Techniques