Naked Pairs
Eliminate candidates to slice through intermediate puzzles.
Mastering Naked Pairs & Candidate Elimination
When transitioning from simple scanning to solving Hard and Expert Sudoku puzzles, basic observation is no longer sufficient. You need subset elimination techniques. The most foundational subset strategy is the Naked Pair.
What is a Naked Pair?
A Naked Pair occurs when exactly two cells within the same house (a row, a column, or a 3×3 box) contain identical twin candidate options—and no other candidates.
For example, imagine two cells in Row 4 that each have candidates {3, 7}.
The Mathematical Logic Behind the Elimination
Because there are only two digits (3 and 7) and two dedicated cells to place them:
- If Cell A receives the 3, Cell B is forced to be 7.
- If Cell A receives the 7, Cell B is forced to be 3.
In all possible universes, digits 3 and 7 are completely locked into these two cells. Therefore, neither 3 nor 7 can exist anywhere else in that entire row. You can immediately and safely eliminate 3 and 7 from all other candidate lists across Row 4!
Step-by-Step Solving Routine
- Pencil Mark Candidates: Use corner/center notations to write down all remaining candidates in houses with 3 to 5 empty cells.
- Spot Identical Bi-Value Cells: Look for two cells within the same row, column, or 3×3 box that share identical 2-digit candidate pairs (e.g.,
[4, 9]and[4, 9]). - Purge Candidates from the House: Cross off digits 4 and 9 from every other cell in that house. This often reduces a neighboring cell to a single candidate (a Naked Single!).
Worked Real-World Example: Cracking Row 7 with a {2, 6} Pair
Consider this exact scenario from a competitive tournament puzzle:
- Row 7 has only four unfilled cells: R7C2, R7C4, R7C6, and R7C8.
- After writing out candidate pencil marks, you discover that R7C2 has candidates
{2, 6}and R7C6 has candidates{2, 6}. - Meanwhile, R7C4 has candidates
{2, 5, 6, 8}and R7C8 has candidates{2, 6, 8}. - Because R7C2 and R7C6 form a tight Naked Pair of
{2, 6}, neither 2 nor 6 can belong to any other cell in Row 7. - We instantly purge digits 2 and 6 from R7C4 and R7C8.
- Look at what happens to R7C8: its original candidates
{2, 6, 8}lose both 2 and 6, leaving only 8! R7C8 becomes a solved Naked Single. - Now that R7C8 is solved as 8, R7C4 loses candidate 8, leaving only 5! A single pair elimination solved two cells in three seconds flat.
Hidden Pairs Explained: The Inversion of Naked Pairs
While a Naked Pair is obvious because the two cells contain only those two digits, a Hidden Pair requires looking at where digits can go in the entire house:
- Suppose two cells in Column 1 have candidate notes
{1, 4, 7, 9}and{1, 4, 6, 8}. - At first glance, these cells do not look like a pair because they are crowded with four candidates each.
- However, when you inspect all nine cells of Column 1, you discover that the digits 7 and 9 cannot go into any other cell in Column 1!
- Because digits 7 and 9 are locked into these two cells, all other candidate numbers (1, 4, 6, 8) can be discarded. The cells transform into a clean
{7, 9}pair!
Intersection Pairs (Box-Line Reduction)
When the two cells forming a pair reside inside the intersection of a 3×3 box and a row (or column), their elimination power doubles:
If two cells in Box 5 on Row 5 share candidates {3, 8}, they eliminate 3 and 8 not only from all other cells in Row 5, but also from all other cells inside Box 5. This dual-action purge is known as Box-Line Reduction and is essential for mastering Master difficulty boards.