Search for a digit
Suppose a 3×3 box is missing 7. For every empty cell check whether 7 already appears in its crossing row or column.
Practical guide
Follow the only position for the digit 6 in Sudoku row five.
A hidden single differs from a naked single. An empty square may have several candidates, but a particular digit fits nowhere else in its row, column or box. The unique position forces the answer.
On the familiar example board, row 5 is 4 · · | 8 · 3 | · · 1. The digit 6 is missing, and its only legal place in that row is column 3. That cell may still have other candidates, but none of the other empty row-5 cells can contain 6.
For every other empty cell in row 5, either its column or the relevant 3×3 box already contains a 6, so that position is excluded. This establishes r5c3 = 6. The conclusion concerns the uniqueness of a location within one row, not whether the square's own candidate list was already down to one.
After placing 6 at row 5, column 3, erase 6 from candidates elsewhere in column 3 and the middle-left box. Revisit the row and look for newly forced numbers.
| 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 |
Choose a row with several filled numbers, pick one of its missing digits, and test that digit against each empty square in the row. Mark every location that survives its column and box checks. If exactly one survives, you have a hidden single.
You can also use the identical method in a column or 3×3 box. If two locations remain, the digit is not yet forced; leave it for a later scan.
Suppose a 3×3 box is missing 7. For every empty cell check whether 7 already appears in its crossing row or column.
If five of six empty cells cannot contain 7, the sixth must be 7 even if you pencilled other possibilities in that cell.
A naked single begins with a cell containing one remaining candidate. A hidden single begins with a digit that has one possible location.
A hidden single is different: the target cell can still list several candidates, but a particular digit appears in only ONE cell of the entire row, column or box.
Choose digit 6 in row 5 of the worked grid. Mark every legal position for 6 and cross out blocked columns and boxes; if just one position remains, place 6 there.
A hidden single may still show two or three pencil marks in its cell. The proof concerns a digit across the whole unit: if every other cell of that row, column or box forbids digit 6, the remaining cell must be 6. Its other pencil marks are eliminated by the positional proof.
Imagine the top-left 3×3 box lacks 6. In its top and middle rows, columns or given 6s elsewhere may forbid every free cell except r3c2. You can put 6 at r3c2 even if that cell’s visible notes had {2,6}. The box cannot place its only 6 anywhere else.
List every empty cell in the chosen unit and explain why the target digit is illegal in each competitor. Then update the same digit in the placed cell’s row, column and box. Do not confuse “only cell in this box” with “only candidate in this cell”.
A hidden single is found by asking where one missing digit can go in a complete unit. Suppose row 3 still needs digit 6. If columns and boxes rule out 6 in every empty cell except r3c7, then r3c7 must contain 6 even if its own preliminary notes still list other candidates. The claim concerns digit 6's only legal position in row 3.
A naked single asks which number can enter a particular cell; a hidden single asks which cell can receive a particular number. They can occasionally identify the same placement, but the proofs differ. When stuck, scan a missing digit across an entire row or box rather than inspecting only one cell at a time.
To use a hidden single, verify that every other empty cell in the chosen unit truly excludes the target digit. An omitted pencil mark is not a legal exclusion. If two legal positions remain, stop: the digit is not hidden-single-forced yet.
Illustrative candidate positions are not universal puzzle solutions; verify all constraints on your current board.