Sudoku Pro العربية

Worked logic example · Beginner

A naked single: why row 5, column 5 must be 5

A naked single is an empty cell with exactly one legal candidate. The word “naked” means the cell's own candidate list has been reduced to one number; you do not have to guess or compare probability.

The puzzle and target cell

Count rows from top to bottom and columns from left to right. The blue-outlined center cell is at row 5, column 5 (r5c5).

Step 1 — inspect row 5

Row 5 reads 4 · · | 8 · 3 | · · 1. The digits already present are 1, 3, 4 and 8. That leaves the set {2, 5, 6, 7, 9} as possible digits for its empty squares.

Step 2 — inspect column 5

Reading column 5 from top to bottom gives 7, 9, ·, 6, ·, 2, ·, 1, 8. The missing digits are {3, 4, 5}. Intersecting with the row list gives just {5}.

Step 3 — verify the middle 3×3 box

The center box (rows 4–6, columns 4–6) already has 6, 8, 3 and 2. Its missing digits are {1, 4, 5, 7, 9}. Of these, only 5 survives the row and column checks, so the box does not contradict the placement.

Conclusion: r5c5 = 5. This conclusion is forced by the puzzle's restrictions. A different number in that square would repeat a digit in its row or column.

After placing the 5

Remove the candidate 5 from all other empty cells in row 5, column 5 and the center 3×3 box. Then scan again. One placement can create another naked single elsewhere; this chain is a common way to make progress.

Common mistake

Finding a number missing from a row does not mean it can go in every empty cell of that row. Every placement must pass the column and box checks too.

5 3 7
6 1 9 5
9 8 6
8 6 3
4 8 3 1
7 2 6
6 2 8
4 1 9 5
8 7 9

Target r5c5 is empty. The cells in its row, column and middle box eliminate all but one digit.

Additional worked reasoning and practice

For r5c5 begin with digits 1–9, delete every digit visible in its row, column and box. If only 5 remains, that is a naked single: the cell itself has one candidate.

After filling the 5, refresh the candidates for all peers of r5c5. This can expose the next single without any guesswork.

Deeper explanation and guided self-check

Three constraints leave exactly one number

Consider r5c5. If its row excludes 1, 2 and 3, its column excludes 4, 6 and 7, and its 3×3 box excludes 8 and 9, only 5 survives all constraints. You have a naked single because the cell itself has exactly one legal value.

Why visual emptiness is misleading

A cell may look isolated in a sparse grid yet still have four legal numbers. Conversely, a cell surrounded by many blanks can be forced when their intersecting units contain nearly every other digit. Candidate counting must be based on rules, not how crowded the screen looks.

Checkpoint

Recompute the row, column and box candidates independently. If even one other number survives, it is not a naked single. After a valid placement, remove that digit from all unsolved peers and look for the next newly created single.

Go further: detailed reasoning and practical examples

The candidate intersection, step by step

For an unsolved r5c5, list all digits 1–9. Suppose its row forbids 1, 2, 3, its column forbids 4, 6, 7, and its box forbids 8 and 9. The union of excluded digits leaves exactly {5}; the cell is a naked single. This is an illustrative constraint set: you must verify the actual givens and candidate notes in the board you are solving.

Check what the deduction does not say

A naked single is about one cell having one possible digit; it does not require the entire row to have one missing digit. Conversely, a row missing just one digit creates an easy single but is not the only way to prove one. If r5c5 still allows {5,9}, the situation is unresolved even when 5 looks more promising.

Update the right peers

After placing 5, remove 5 from other unsolved cells in row 5, column 5 and the central box. The same cell can belong to more than one of these units, but it should be counted only once in your notes. Then rescan all affected empty cells for new one-candidate lists.

Illustrative candidate positions are not universal puzzle solutions; verify all constraints on your current board.