Can't Place the 5? You May Still Know Where It Can't Go.
The 5 could go in either of two cells. You cannot tell which one, so you move on. But those two possibilities may already tell you something certain about a third cell.
That is the useful surprise behind locked candidates: you can sometimes rule out a digit without knowing exactly where it belongs. If you are comfortable with pencil marks but keep running out of singles, this gives you another practical thing to look for.
We will work through one example, explain why the elimination is safe, and turn it into a short scanning routine.
Look for a digit that cannot leave one row of a box
Choose a 3×3 box that still needs a 5. Check every empty cell in that box against the placed digits in its row and column.
Suppose only two cells can hold 5, and both are in the same row. The box must get its 5 in one of those cells. Whichever one it is, that row’s 5 will be inside the box.
So no cell in that row outside the box can contain 5. You can erase those outside 5 candidates now, even though the two cells inside remain unresolved.
The same reasoning works down a column. The important condition is that every remaining location for the digit in the box lies on that one row or column.
Try it on this grid
Dots are empty cells. Rows run from top to bottom; columns run from left to right. For example, r1c6 means row 1, column 6.
This partial grid illustrates the deduction. It has a valid completion, but it is not presented as a puzzle with a unique solution.
. . . | 6 7 . | 9 . .
6 . 2 | 1 9 . | 3 4 .
1 . . | 3 . 2 | 5 6 7
------+-------+------
. 5 . | 7 . 1 | . . 3
. 2 . | 8 . 3 | . . .
. 1 . | . . . | . 5 .
------+-------+------
9 . . | . . . | . . .
. . . | . . . | . . 5
3 . . | 2 . . | . 7 .
Focus on the top-left box: rows 1–3, columns 1–3. Where could its 5 go?
- None of its three cells in column 2 can take 5, because r4c2 already contains 5.
- r3c3 cannot take 5, because row 3 already contains 5 at r3c7.
- r2c1, r2c3, and r3c1 are filled with other digits.
That leaves r1c1 and r1c3, both in row 1. Neither cell’s row, column, or box contains a placed 5, so both remain candidates at this stage.
Now look at r1c6, outside that box but on the same row. Checking only placed digits gives it these candidates:
| Cell | Candidates before the deduction | Candidates afterward |
|---|---|---|
| r1c1 | 4, 5, 8 | 4, 5, 8 |
| r1c3 | 3, 4, 5, 8 | 3, 4, 5, 8 |
| r1c6 | 4, 5, 8 | 4, 8 |
Erase 5 from r1c6. Leave the 5 candidates in r1c1 and r1c3 alone: they are the reason the elimination works.
This does not immediately solve a cell. It still makes progress by reducing what is possible.
Test the deduction by trying to break it
Imagine putting 5 in r1c6 instead.
Row 1 would then forbid 5 in both r1c1 and r1c3. But those were the only places the top-left box could get its 5. The box would have nowhere to put a required digit.
That contradiction is why r1c6 cannot be 5. We did not choose between the two cells inside the box, and we did not guess.
This proof depends on the existing entries being correct and on checking the entire box. Overlooking one possible location in another row would break the argument.
The names describe the direction
With two aligned locations inside a box, this pattern is often called a pointing pair; with three, a pointing triple. Andrew Stuart’s SudokuWiki guide explains these patterns and their reverse, box/line reduction, under intersection removal.
For the reverse direction, start with a row rather than a box. If every possible location for its missing 5 is inside one box, that box’s 5 must belong to that row. Remove 5 from the other rows of the box. Columns work the same way.
Ask which group forces the digit into the overlap. Remove candidates from the other group, outside that overlap.
Avoid these two tempting mistakes
Two visible notes are not necessarily all the possibilities. If you write only some candidates, another cell may still allow 5 without having a small 5 written in it. Check all nine cells of the box before making an elimination. Our guide to keeping notes accurate explains why incomplete notes can mislead you.
A pointing pair does not mean two matching candidate lists. In the example, r1c1 and r1c3 have different lists. What matters is the location of one digit, 5. Do not erase 4 or 8 from the rest of row 1 just because those digits also appear in the two cells.
Give yourself one new question when you get stuck
In today’s Sudoku, choose a box and one missing digit. Find every cell in that box where the digit could still go. If they all line up, follow that row or column out of the box and look for a candidate you can remove.
Then check the cells whose notes changed. An elimination may reveal a single, or it may only prepare a later deduction. Either way, you have made a move you can justify.
You do not always need to answer “Where does this digit go?” first. Sometimes “Which row of this box must contain it?” is enough to move forward.
Comments
Share a thought, ask a question, or help a fellow solver.
Checking sign-in…
Loading comments…