Almost locked set basics
Difficulty Very Hard foundationTwo cells in one house with three candidate digits between them form an almost locked set. The cells need two different digits, so they can leave out only one. Larger sets follow the same counting rule.
Count the digits in cells that share a house
Choose a few empty cells in the same row, column, or box. Count the different digits across all their candidate lists.
One extra digit
An almost locked set (ALS) has exactly one more possible digit than cells. For example, {1, 4} and {4, 8} give two cells three possible digits. One cell with two candidates is the smallest ALS.
Two cells with three possible digits
R6C4 and R6C5 share row 6. Compare three separate trials, one for each missing digit.
Count 1, 4, and 8 once each
- 2 cells
- 3 distinct digits
- Absent digit: unknown
These two cells must use two different digits from {1, 4, 8}. Exactly one digit is absent from the pair.
| Digit excluded | First cell | Second cell |
|---|---|---|
| 1 | 4 | 8 |
| 4 | 1 | 8 |
| 8 | 1 | 4 |
The two cells must use different digits, so exactly one of the three digits is absent. If the set loses every possible 4, the cells must use 1 and 8.
An ALS alone does not remove anything
The count alone cannot tell you which digit is absent. A link to another cell or set can rule out one digit and force all the others.