Learn Sudoku
Locked candidates
One intersection. Two directions of reasoning.
Sometimes a digit has several possible cells, yet all of them share something useful: one row or column inside a box. You cannot place the digit yet. You can still prove where it cannot go.
When to use it
Pointing starts in a box: if every remaining position for a digit in that box lies on one row or column, remove the digit from that line outside the box. Claiming starts in a line: if all its positions for a digit lie inside one box, remove the digit from the rest of that box.
How to find it
- 01
Choose one digit and inspect every remaining position in the source unit.
- 02
Confirm that all those positions belong to the same box-line intersection.
- 03
Remove the digit only from the target unit outside that intersection.
Pointing: start inside the box
v1-hard-0001 · position before step 12
Read the position as a cell table
| Cell | Value / candidates |
|---|---|
| r1c1 | Placed: 2 |
| r1c2 | Placed: 7 |
| r1c3 | Placed: 3 |
| r1c4 | Placed: 1 |
| r1c5 | Placed: 8 |
| r1c6 | Placed: 5 |
| r1c7 | Placed: 4 |
| r1c8 | {6, 9} |
| r1c9 | {6, 9} |
| r2c1 | Placed: 5 |
| r2c2 | {1, 8, 9} |
| r2c3 | {4, 6, 8, 9} |
| r2c4 | {4, 6, 7} |
| r2c5 | {4, 6, 7} |
| r2c6 | {4, 6, 7} |
| r2c7 | Placed: 3 |
| r2c8 | Placed: 2 |
| r2c9 | {1, 6, 8, 9} |
| r3c1 | {1, 4, 8} |
| r3c2 | {1, 8} |
| r3c3 | {4, 6, 8} |
| r3c4 | Placed: 3 |
| r3c5 | Placed: 9 |
| r3c6 | Placed: 2 |
| r3c7 | Placed: 5 |
| r3c8 | {1, 6, 8} |
| r3c9 | Placed: 7 |
| r4c1 | Placed: 3 |
| r4c2 | {2, 5, 8, 9} |
| r4c3 | {2, 4, 5, 8, 9} |
| r4c4 | {4, 5, 8, 9} |
| r4c5 | {2, 4} |
| r4c6 | Placed: 1 |
| r4c7 | Placed: 6 |
| r4c8 | Placed: 7 |
| r4c9 | {2, 4} |
| r5c1 | Placed: 7 |
| r5c2 | {2, 5, 8} |
| r5c3 | {2, 4, 5, 8} |
| r5c4 | {4, 5, 6, 8} |
| r5c5 | {2, 3, 4, 6} |
| r5c6 | {4, 6, 8} |
| r5c7 | Placed: 9 |
| r5c8 | {1, 4} |
| r5c9 | {1, 2, 3, 4} |
| r6c1 | {4, 9} |
| r6c2 | Placed: 6 |
| r6c3 | Placed: 1 |
| r6c4 | {4, 7, 9} |
| r6c5 | {2, 3, 4, 7} |
| r6c6 | {4, 7, 9} |
| r6c7 | Placed: 8 |
| r6c8 | Placed: 5 |
| r6c9 | {2, 3, 4} |
| r7c1 | Placed: 6 |
| r7c2 | {1, 2, 5, 8, 9} |
| r7c3 | {2, 5, 8, 9} |
| r7c4 | {4, 7, 8, 9} |
| r7c5 | {1, 4, 7} |
| r7c6 | {4, 7, 8, 9} |
| r7c7 | {2, 7} |
| r7c8 | Placed: 3 |
| r7c9 | {2, 4, 8, 9} |
| r8c1 | {1, 8, 9} |
| r8c2 | Placed: 4 |
| r8c3 | {2, 8, 9} |
| r8c4 | {6, 7, 8, 9} |
| r8c5 | {1, 6, 7} |
| r8c6 | Placed: 3 |
| r8c7 | {2, 7} |
| r8c8 | {6, 8, 9} |
| r8c9 | Placed: 5 |
| r9c1 | {8, 9} |
| r9c2 | Placed: 3 |
| r9c3 | Placed: 7 |
| r9c4 | Placed: 2 |
| r9c5 | Placed: 5 |
| r9c6 | {4, 6, 8, 9} |
| r9c7 | Placed: 1 |
| r9c8 | {4, 6, 8, 9} |
| r9c9 | {4, 6, 8, 9} |
Look first. Reveal one layer at a time.
Find the supporting cells, explain the restriction, then inspect the candidates it removes. The original puzzle link starts from its givens; this panel preserves the intermediate logical state.
Inspect r2c2 and r2c3. Follow these candidates: 9.
In box 1, digit 9 is confined to r2c2 and r2c3. Those cells also belong to row 2. Wherever this digit is placed in the source unit, it occupies that intersection, so it cannot appear in the rest of the target unit. This is Pointing.
The productive elimination
- Remove 9 from r2c9.
Claiming: start in the line
Reverse the source and target units. All positions for one digit in the line lie in a single box, so the other cells of that box cannot use that digit.
v1-hard-0007 · position before step 16
Read the position as a cell table
| Cell | Value / candidates |
|---|---|
| r1c1 | Placed: 7 |
| r1c2 | Placed: 1 |
| r1c3 | {2, 3, 4, 8} |
| r1c4 | {2, 9} |
| r1c5 | {2, 3, 9} |
| r1c6 | {2, 4} |
| r1c7 | Placed: 5 |
| r1c8 | Placed: 6 |
| r1c9 | {3, 8} |
| r2c1 | {2, 4, 5} |
| r2c2 | {2, 4, 5, 6} |
| r2c3 | {2, 3, 4, 5, 6} |
| r2c4 | Placed: 8 |
| r2c5 | {2, 3, 5, 6, 7} |
| r2c6 | {2, 4, 6} |
| r2c7 | Placed: 1 |
| r2c8 | {2, 7} |
| r2c9 | Placed: 9 |
| r3c1 | Placed: 9 |
| r3c2 | {2, 5, 6, 8} |
| r3c3 | {2, 3, 5, 6, 8} |
| r3c4 | {2, 5, 6, 7} |
| r3c5 | Placed: 1 |
| r3c6 | {2, 6} |
| r3c7 | Placed: 4 |
| r3c8 | {2, 7} |
| r3c9 | {3, 8} |
| r4c1 | {2, 4, 5} |
| r4c2 | Placed: 7 |
| r4c3 | {2, 4, 5} |
| r4c4 | Placed: 3 |
| r4c5 | {2, 5} |
| r4c6 | Placed: 8 |
| r4c7 | Placed: 9 |
| r4c8 | Placed: 1 |
| r4c9 | Placed: 6 |
| r5c1 | Placed: 8 |
| r5c2 | {2, 6, 9} |
| r5c3 | {2, 6, 9} |
| r5c4 | Placed: 4 |
| r5c5 | {2, 7} |
| r5c6 | Placed: 1 |
| r5c7 | {2, 7} |
| r5c8 | Placed: 3 |
| r5c9 | Placed: 5 |
| r6c1 | {2, 5} |
| r6c2 | Placed: 3 |
| r6c3 | Placed: 1 |
| r6c4 | {2, 5, 6, 7} |
| r6c5 | {2, 5, 6, 7} |
| r6c6 | Placed: 9 |
| r6c7 | {2, 7} |
| r6c8 | Placed: 8 |
| r6c9 | Placed: 4 |
| r7c1 | Placed: 3 |
| r7c2 | {2, 4, 5} |
| r7c3 | {2, 4, 5} |
| r7c4 | {1, 2, 6} |
| r7c5 | {2, 4, 6} |
| r7c6 | Placed: 7 |
| r7c7 | Placed: 8 |
| r7c8 | Placed: 9 |
| r7c9 | {1, 2} |
| r8c1 | Placed: 6 |
| r8c2 | {2, 9} |
| r8c3 | {2, 7, 9} |
| r8c4 | {1, 2, 9} |
| r8c5 | Placed: 8 |
| r8c6 | Placed: 5 |
| r8c7 | Placed: 3 |
| r8c8 | Placed: 4 |
| r8c9 | {1, 2, 7} |
| r9c1 | Placed: 1 |
| r9c2 | {2, 4, 8, 9} |
| r9c3 | {2, 4, 7, 8, 9} |
| r9c4 | {2, 9} |
| r9c5 | {2, 4, 9} |
| r9c6 | Placed: 3 |
| r9c7 | Placed: 6 |
| r9c8 | Placed: 5 |
| r9c9 | {2, 7} |
Look first. Reveal one layer at a time.
Find the supporting cells, explain the restriction, then inspect the candidates it removes. The original puzzle link starts from its givens; this panel preserves the intermediate logical state.
Inspect r1c6, r2c6, and r3c6. Follow these candidates: 2.
In column 6, digit 2 is confined to r1c6, r2c6, and r3c6. Those cells also belong to box 2. Wherever this digit is placed in the source unit, it occupies that intersection, so it cannot appear in the rest of the target unit. This is Claiming.
The productive elimination
- Remove 2 from r1c4.
- Remove 2 from r1c5.
- Remove 2 from r2c5.
- Remove 2 from r3c4.
When the rule does not apply
Suppose 7 is possible at r1c1 and r1c3 in the top-left box. They appear to point along row 1. But if r2c2 also permits 7, the digit could go there instead. You cannot remove 7 from the rest of row 1 on that evidence.
In that counterexample, is it valid to remove 7 from r1c5?
Show why
No. The extra candidate at r2c2 breaks the confinement to row 1. Two aligned candidates are not enough: all positions for that digit in the source box must align.
Try another position
This comes from a different puzzle. Use the condition, rather than the location you remember from the first example.
v1-hard-0002 · position before step 23
Read the position as a cell table
| Cell | Value / candidates |
|---|---|
| r1c1 | Placed: 7 |
| r1c2 | Placed: 1 |
| r1c3 | Placed: 5 |
| r1c4 | {2, 3, 6, 8} |
| r1c5 | {2, 3, 6} |
| r1c6 | {3, 8} |
| r1c7 | {4, 6, 8} |
| r1c8 | Placed: 9 |
| r1c9 | {4, 8} |
| r2c1 | Placed: 9 |
| r2c2 | {6, 8} |
| r2c3 | {6, 8} |
| r2c4 | Placed: 1 |
| r2c5 | Placed: 4 |
| r2c6 | Placed: 5 |
| r2c7 | Placed: 3 |
| r2c8 | Placed: 2 |
| r2c9 | Placed: 7 |
| r3c1 | {2, 3, 4} |
| r3c2 | {2, 3, 4, 6, 8} |
| r3c3 | {2, 3, 4, 6, 8} |
| r3c4 | Placed: 9 |
| r3c5 | {2, 3, 6} |
| r3c6 | Placed: 7 |
| r3c7 | {4, 6, 8} |
| r3c8 | Placed: 1 |
| r3c9 | Placed: 5 |
| r4c1 | Placed: 6 |
| r4c2 | Placed: 9 |
| r4c3 | {2, 3, 4} |
| r4c4 | {3, 4} |
| r4c5 | Placed: 5 |
| r4c6 | Placed: 1 |
| r4c7 | {4, 8} |
| r4c8 | Placed: 7 |
| r4c9 | {2, 4, 8} |
| r5c1 | {1, 4} |
| r5c2 | Placed: 5 |
| r5c3 | {1, 4} |
| r5c4 | Placed: 7 |
| r5c5 | Placed: 8 |
| r5c6 | Placed: 2 |
| r5c7 | Placed: 9 |
| r5c8 | Placed: 3 |
| r5c9 | Placed: 6 |
| r6c1 | Placed: 8 |
| r6c2 | Placed: 7 |
| r6c3 | {2, 3, 4} |
| r6c4 | {3, 4} |
| r6c5 | Placed: 9 |
| r6c6 | Placed: 6 |
| r6c7 | Placed: 1 |
| r6c8 | Placed: 5 |
| r6c9 | {2, 4} |
| r7c1 | {1, 2, 3, 4} |
| r7c2 | {2, 3, 4, 6, 8} |
| r7c3 | Placed: 7 |
| r7c4 | {2, 3, 4, 6, 8} |
| r7c5 | {1, 2, 3, 6} |
| r7c6 | {3, 4, 8} |
| r7c7 | Placed: 5 |
| r7c8 | {4, 6} |
| r7c9 | Placed: 9 |
| r8c1 | {3, 4} |
| r8c2 | {3, 4, 6, 8} |
| r8c3 | Placed: 9 |
| r8c4 | Placed: 5 |
| r8c5 | Placed: 7 |
| r8c6 | {3, 4, 8} |
| r8c7 | Placed: 2 |
| r8c8 | {4, 6} |
| r8c9 | Placed: 1 |
| r9c1 | Placed: 5 |
| r9c2 | {2, 4, 6} |
| r9c3 | {1, 2, 4, 6} |
| r9c4 | {2, 4, 6} |
| r9c5 | {1, 2, 6} |
| r9c6 | Placed: 9 |
| r9c7 | Placed: 7 |
| r9c8 | Placed: 8 |
| r9c9 | Placed: 3 |
A new position. Your deduction.
Which action is justified by this pattern? Inspect the full candidate state before choosing. You can ask for a hint at any time.
Inspect r3c1, r3c2, and r3c3. Follow these candidates: 2.
In box 1, digit 2 is confined to r3c1, r3c2, and r3c3. Those cells also belong to row 3. Wherever this digit is placed in the source unit, it occupies that intersection, so it cannot appear in the rest of the target unit. This is Pointing.
The productive elimination
- Remove 2 from r3c5.
Make the distinction
A pointing pair is not a naked pair. Pointing follows one digit across two or three cells. A naked pair reserves two digits for exactly two cells in one unit.
Compare with naked pairs