Skip to content

Academy

Naked Pair sudoku technique

Intermediate level Appears in puzzles rated SE 1.5 – 2.0

When two cells in the same unit hold exactly the same two candidates — say 2 and 7, and nothing else — those two digits are spoken for. One cell will take the 2 and the other the 7; you may not know which way round yet, but no other cell in that unit can have either. Erasing 2 and 7 from the rest of the unit often cracks it open.

How to find a naked pair

  1. Write pencil marks for a unit that refuses to move.
  2. Look for two cells whose candidate lists are identical and exactly two digits long.
  3. Remove both digits from every other cell in that unit.
  4. Check what the eliminations reveal — a naked pair very often exposes a single in the next breath.
From the table: The pair only works when both cells carry exactly those two candidates. Cells with 2-7 and 2-7-9 are not a naked pair — though the 9 might be removable by other means, and then the pair appears. Accurate pencil marks are what make this technique reliable.

The pattern on the grid

24646971468168931451349453459124912345135967813468714134561356291489253157461246245618456569735239734561491456281519362623659418757234812123813893463491348967385234

A real position — every pencil mark computed, every red candidate a verified elimination. Toggle to see the grid after the move.

Naked Pair 14: r3c4, r3c9 => r3c1<>14, r3c5<>14, r3c6<>1
200700305000000678087000290890307460001800700730002800000594187570000906010670520

Standard 81-character format (0 = empty) — paste it into your solver of choice and verify the move yourself.

Worked example

The cells r3c4, r3c9 form a naked pair on {1, 4}. Those digits are consumed inside the set however they distribute, so the shared unit sweeps them out everywhere else: r3c1 loses 14, r3c5 loses 14, r3c6 loses 1. Check the pencil marks in the diagram — every elimination is verifiable by eye.

When it fails

The pair must live in one shared unit. Cells r5c2 and r6c6 with identical candidates share nothing and prove nothing — geometry first, candidates second.

Puzzles that need it

These grids come from rated games on this site — our solver confirmed that naked pair was part of the shortest solving path for each one.

36115266422187969873289542294
Expert SE 2.6 29 clues
000306010105020600060400020200000108070090060908000007030002080009050402020904000
37823177821689271892748161653731
Expert SE 2.6 32 clues
300700008002031700070082010068000009027000180900000270040810060001650300700003001
9842475196254739312584734136
Expert SE 2.6 28 clues
090804020400705001000090000620000054007000300930000012000050000800407003040103060

Every string is the standard 81-character format (0 = empty) — paste it into any solver to verify the rating and the solving path yourself. Want to try one under the clock? Play a free puzzle — no account needed — or create an account to train specific difficulty tiers.

Related techniques

All solving techniques