Naked and hidden singles are the two ways a puzzle hands you a digit for free, and together they place more cells than every other technique combined. A candidate is a digit still legal in a cell. A unit is one row, one column or one box. Singles come from counting candidates and nothing else.
A naked single is a cell with exactly one candidate left. The other eight digits are blocked by a solved peer in the same row, column or box, so the survivor has to go in. You read it straight off the cell.
A hidden single is a digit with exactly one legal cell in a unit. That cell may still carry several candidates, which is why the single is hidden: you find it by scanning a unit for a digit, not by scanning a cell for digits.
| Naked single | Hidden single | |
|---|---|---|
| You scan | one cell | one unit |
| The clue | only one candidate survives | only one cell can take the digit |
| Typical spot | a cell with many solved peers | a box where the digit is blocked almost everywhere |
| Result | write that candidate | write that digit |
Both give you a placement rather than an elimination, which makes them the cheapest moves on the board.
On an easy grid hidden singles tend to appear first, because a box with six givens blocks a digit from nearly every empty cell.
Naked single - one cell, one candidate left:
r3c4 {6} -> r3c4 = 6
Hidden single - one digit, one legal cell in the row:
r5 c1 c2 c3 c4 c5 c6 c7 c8 c9
{3,7} {3,7} [5] {1,4,9} [2] {1,4} [6] {4,9} {1,4,8}
Row 5 still needs 1, 3, 4, 7, 8 and 9.
The digit 8 is legal in c9 and nowhere else -> r5c9 = 8
Cell c9 held three candidates, so there was no naked single to read there. Only the row-wide count for the digit 8 exposed it.
Singles alone solve easy classic Sudoku, and they carry most Medium puzzles too. Every harder technique in the game exists for one reason: to create the next single. So the sweep above is the move you will repeat hundreds of times on any grid, at any level.