Beginner to Intermediate

Sudoku Techniques:
Visual Step-by-Step Guide

Elimination • Naked Single • Naked Pair • Pointing Pairs

~12 minutes 6 grid examples

All of sudoku's logic rests on four pillars. Without them, tougher puzzles stay unsolved; master them, and most become manageable. But there's a gap between knowing a technique and seeing it on the grid — and what bridges that gap is visual practice.

Each technique is covered here in three layers: first what it is, then how it works, and finally how it looks in a real grid example. The order isn't arbitrary — without elimination, naked singles stay invisible; without naked singles, naked pairs are useless; and pointing pairs assume both.

The techniques covered in this article
  • Elimination: Which digit can't go in this cell?
  • Naked Single: Finding the cell that can only hold one digit
  • Naked Pair: Using two cells that share exactly the same two candidates
  • Pointing Pairs: Converting a box's candidate distribution into a row or column cleanup

Elimination is the foundation of all sudoku logic. Every other technique — including naked singles — builds on top of it. The central question is: "Can this digit go in this cell?" The answer comes down to three rules.

Three Rules, One Logic

The sudoku rule is simple: every row, every column, and every 3×3 box contains the digits 1 through 9 exactly once. Elimination works by reversing that rule: if a digit is already present in a row, column, or box, it can't appear in any other cell of that same row, column, or box.

Visual Example — Elimination

┌───────┬───────┬───────┐ │ 5 3 · │ · 7 · │ · · · │ │ 6 · · │ 1 9 5 │ · · · │ │ · 9 8 │ · · · │ · 6 · │ ├───────┼───────┼───────┤ │ 8 · · │ · 6 · │ · · 3 │ │ 4 · · │ 8 · [?]│ · · 1 │ │ 7 · · │ · 2 · │ · · 6 │ ├───────┼───────┼───────┤ │ · 6 · │ · · · │ 2 8 · │ │ · · · │ 4 1 9 │ · · 5 │ │ · · · │ · 8 · │ · 7 9 │ └───────┴───────┴───────┘
Fig. 1 — Cell marked [?]: row 5, column 6. Which digit belongs here?

Step-by-Step Solution

1.Scan the row (row 5): 4, 8, 1 are present → those three eliminated.
2.Scan the column (column 6): 7, 5, 6, 2, 9, 8 are present → those six also eliminated.
3.Scan the box (middle-right 3×3): 6, 5, 3, 1 are present → eliminated as well.
4.The only digit left after all eliminations: just the 4.

The 4 goes in this cell. There's no other option. Not a guess — a deduction.

The key to elimination

You need to run elimination mentally not just on empty cells, but on filled ones too. The question "does this 7 here affect that cell?" should be asked for every digit already on the board. This habit starts running automatically before you even begin looking for naked singles.


If only one digit can go in a cell, that digit must go there. It's called "naked" because the cell sits right out in the open with its single candidate — not hidden, just proven.

Finding a naked single requires a candidate list: the set of all digits that can still go in a cell after elimination. The moment that list hits one entry, a naked single has appeared.

How to Build the Candidate List

For each empty cell, ask: which digits from 1 to 9 can't go here? Cross off every digit already present in the same row, column, or box. What's left is that cell's candidate list.

On Sudokum.Net, the N key activates note mode. Digits entered in note mode are saved as small candidate annotations inside the cell. This lets you spot naked singles visually on the grid rather than tracking them in your head.

Visual Example — Naked Single

┌───────┬───────┬───────┐ │ 5 3 4 │ 6 7 8 │ 9 1 2 │ │ 6 7 2 │ 1 9 5 │ 3 4 8 │ │ 1 9 8 │ 3 4 2 │ 5 6 7 │ ├───────┼───────┼───────┤ │ 8 5 9 │ 7 6 1 │ 4 2 3 │ │ 4 2 6 │ 8 5 [?]│ 7 9 1 │ │ 7 1 3 │ 9 2 4 │ 8 5 6 │ ├───────┼───────┼───────┤ │ 9 6 1 │ 5 3 7 │ 2 8 4 │ │ 2 8 7 │ 4 1 9 │ 6 3 5 │ │ 3 4 5 │ 2 8 6 │ 1 7 9 │ └───────┴───────┴───────┘
Fig. 2 — Row 5, column 6: only one candidate remains.

Step-by-Step Solution

1.Digits in row 5: 4, 2, 6, 8, 5, 7, 9, 1 → 8 digits present, only the 3 missing.
2.Digits in column 6: 8, 5, 2, 1, 4, 7, 9, 6 → 8 digits present, only the 3 missing.
3.Digits in the middle-right box: 9, 1, 3, 4, 7, 8, 6, 5 → 8 digits present.
4.After eliminating by row, column, and box, the only one left: the 3. Only the 3 can go here.

You don't need to scan every cell in the grid to find a naked single. The efficient approach: start with rows and columns that already have the most digits filled in. If a row has 7 or 8 digits, one or more of its empty cells is likely a naked single.

Naked single vs. hidden single

A naked single is cell-based — "only one digit fits here." A hidden single is digit-based — "this digit, in this row, can only go here." Both identify a single candidate, but from opposite directions. Naked singles are found through the candidate list; hidden singles, by analyzing the digit's distribution.


Naked pairs require a slightly more advanced way of thinking. The idea: if two cells share exactly the same two candidates and belong to the same row, column, or box, those two candidates can be eliminated from every other cell in that unit.

Why? Because those two digits will definitely end up in those two cells — even if we don't yet know which goes where. That certainty makes keeping those two digits as candidates elsewhere in the unit pointless.

Visual Example — Naked Pair

Column 3 — With candidate notes: ┌──────────────────────────┐ │ Row 1 Column 3: [1, 7] │ ← Naked pair cell │ Row 2 Column 3: [2, 5, 8] │ │ Row 3 Column 3: [1, 7] │ ← Naked pair cell │ Row 4 Column 3: [2, 5, 7, 8] │ │ Row 5 Column 3: [2, 4, 7] │ │ Row 6 Column 3: [2, 5, 7, 8] │ │ Row 7 Column 3: [3, 5] │ │ Row 8 Column 3: [2, 5, 8] │ │ Row 9 Column 3: [2, 5, 6] │ └──────────────────────────┘
Fig. 3 — Column 3: Row 1 Column 3 and Row 3 Column 3 contain only [1, 7]. Naked pair formed.

Step-by-Step Solution

1.Candidates in Row 1 Column 3: [1, 7]. Candidates in Row 3 Column 3: [1, 7]. Same two candidates, same two cells — naked pair identified.
2.These two digits (1 and 7) will definitely go in Row 1 Column 3 and Row 3 Column 3. We don't know which goes where yet, but both are locked to those two cells.
3.Eliminate 1 and 7 from all other cells in column 3: Row 4 Column 3 → [2, 5, 8], Row 5 Column 3 → [2, 4], Row 6 Column 3 → [2, 5, 8].
4.Row 5 Column 3 is down to [2, 4] — the naked pair effect has turned it into a naked single. The solving chain has started.

Second Example — Naked Pair Inside a Box

Top-left 3×3 box — With candidate notes: ┌─────────────────────────────────┐ │ Row 1 Column 1: [4] Row 1 Column 2: [3,9] Row 1 Column 3: [3,9] │ ← Naked Pair │ Row 2 Column 1: [6] Row 2 Column 2: [2,5,8] Row 2 Column 3: [2,8] │ │ Row 3 Column 1: [1,7,8] Row 3 Column 2: [2,5,8] Row 3 Column 3: [2,8] │ └─────────────────────────────────┘
Fig. 4 — Top-left box: Row 1 Column 2 and Row 1 Column 3 contain only [3, 9]. Naked pair.
1.Row 1 Column 2 = [3, 9], Row 1 Column 3 = [3, 9]. Same two candidates, same box and same row — double effect.
2.3 and 9 are eliminated from the other cells in the box. They're also eliminated from the other cells in row 1.
3.Row 2 Column 3 = [2, 8], Row 3 Column 3 = [2, 8] → these form a naked pair inside the box as well. Chain elimination kicks in.
Why naked pairs are hard to see

It's slow at first — you have to compare candidate lists cell by cell. In experienced solvers, that comparison is automatic: when they spot a cell with two candidates, they reflexively check whether a matching cell exists. That reflex typically clicks in after 50 to 100 puzzles.


Pointing pairs are an observation about how candidates are distributed inside a box. If a digit's candidates within a single 3×3 box all fall on just one row or one column, that digit can be eliminated from the cells of that row or column that lie outside the box.

That's where the name comes from: those two (or three) cells are "pointing" outward along the row or column. It's the only technique that takes a conclusion from inside a box and carries it into the row or column dimension.

Visual Example — Pointing Pairs Along a Row

Distribution of 3 across the box and row: ┌────────────┬────────────┬────────────┐ │ · · · │ [3] · [3]│ · · · │ ← Row 1 │ · · · │ · · · │ · · · │ │ · · · │ · · · │ · · · │ └────────────┴────────────┴────────────┘ Left box CENTER BOX Right box Candidates for 3 in the top-center box: only in row 1 (C4 and C6).
Fig. 5 — Candidates for 3 in the top-center box are confined to row 1.

Step-by-Step Solution

1.Find the candidate cells for 3 in the top-center 3×3 box: Row 1 Column 4 and Row 1 Column 6.
2.Both are in row 1. There's no room for a 3 in row 2 or row 3 within this box.
3.That means the 3 from this box will go in row 1. The row-1 cells in the left box (C1, C2, C3) and right box (C7, C8, C9) can no longer hold a 3.
4.3 is eliminated from the row-1 cells of the left box and the right box.

Second Example — Pointing Pairs Along a Column

Distribution of 7 along the column (left box): ┌───────┐ │ · · · │ R1 — Top │ · · · │ R2 │ · · · │ R3 ├───────┤ │ ·[7]· │ R4 — Middle ← C2 │ ·[7]· │ R5 ← C2 │ · · · │ R6 ├───────┤ │ · · · │ R7 — Bottom │ · · · │ R8 │ · · · │ R9 └───────┘ LEFT BOX — candidates for 7 only in C2 (R4 and R5).
Fig. 6 — Candidates for 7 in the middle-left box are confined to column 2. The 7 is eliminated from the top and bottom sections of column 2.
1.Find the candidate cells for 7 in the middle-left 3×3 box: Row 4 Column 2 and Row 5 Column 2.
2.Both are in column 2. There's no room for a 7 in column 1 or column 3 within this box.
3.That means the 7 from this box will go in column 2. The column-2 cells in the top box (R1–R3) and bottom box (R7–R9) can no longer hold a 7.
4.7 is eliminated from the C2 cells in the top section and from the C2 cells in the bottom section.
Pointing pairs vs. box/line reduction

Pointing pairs work from the box outward to the row or column. Box/line reduction is the reverse — it spots that a candidate in a row or column is confined to a single box and clears the rest of that box. Two complementary directions, the same underlying logic.


Order matters — skipping a technique can make the next one invisible. An efficient solving routine works like this:

# Technique When?
1EliminationBuild or update the candidate list for every empty cell.
2Naked SingleAny cells with a candidate list down to one digit? Fill them in.
3Hidden SingleScan each digit across every row, column, and box. If it fits in only one cell, write it in.
4Naked PairAny pairs of cells sharing the same two candidates? Apply the effect.
5Pointing PairsIn each box, are any digit's candidates confined to one row or column? If so, clean outward.

When you're stuck, go back to the top of this sequence. Every time a technique produces progress, you need to restart from step one — because changing one cell affects the candidate lists of others.

The Sudokum.Net tool that supports this sequence

The Game Coach's Teaching mode shows in real time which technique can be applied. Instead of keeping the sequence above in your head, the Game Coach analyzes the current grid state and suggests the right technique. Invaluable during the learning phase — but don't read the hint before you've tried to spot the technique yourself.


Can every sudoku be solved with these four techniques?
For easy puzzles and the vast majority of medium ones, yes. At the hard level, more advanced techniques such as X-Wing and Swordfish may be needed. But moving on to advanced techniques before automating these four is inefficient — without a solid foundation, the upper layers don't hold.
How do I remember the difference between a naked single and a naked pair?
Naked single: one cell, one candidate — solves the cell directly. Naked pair: two cells, two candidates — and those two candidates are identical in both cells. The naked single resolves directly; the naked pair narrows the candidates of other cells and advances the puzzle indirectly.
Why are pointing pairs hard to spot?
Because your perspective has to shift from the box to the row or column — you're reading two dimensions at once. The practical approach: for every box and every digit, systematically ask "are all the candidates for this digit on a single row or column?" It's slow at first, but becomes a reflex after a few dozen puzzles.
Do I have to write candidate notes?
For easy puzzles, usually not — naked singles can be spotted visually. From medium difficulty onward, seeing naked pairs and pointing pairs without candidate notes becomes very hard. On Sudokum.Net the N key activates note mode — writing in candidates by hand both deepens your feel for the grid and makes the techniques easier to apply.

To Wrap Up

The gap between knowing these four techniques and seeing them on the grid closes with practice. You were already doing elimination — just not systematically. Once you start spotting naked singles, the grid looks different; with naked pairs, you feel the logic of the chain. Pointing pairs show you how a box "talks" to its row and column — and at that moment, the way you see puzzles changes.

Make elimination a habit — without candidate notes the naked pair stays hidden, and without the naked pair the pointing pairs are useless. Each technique builds on the one before it — which is why the order isn't optional.