Restricted common candidates
Difficulty Master foundationTwo almost locked sets can share a candidate digit that only one of them can use. This is a restricted common candidate. At least one set must leave it out and use all its other digits.
Compare every place for the shared digit
Choose two separate almost locked sets with no cells in common. Pick a digit that appears in both.
Shared is not yet restricted
Compare every place for that digit in the first set with every place in the second. If every cross-set pair sees each other, the digit is a restricted common candidate (RCC).
For example, if every possible 6 in both sets lies in row 8, only one set can use 6.
A digit that cannot appear in both sets
Blue marks two cells with {1, 4, 6} between them. Amber marks two cells with {2, 6, 7}.
Find every 6 in row 8
- A uses 6 - B uses 6
The three possible 6s all share row 8. A 6 in either set rules out every 6 in the other.
| Locations of 6 | RCC? |
|---|---|
| All occurrences in both sets share row 8 | Yes. |
| One occurrence in the first set cannot see one in the second | No. |
| Both sets contain 6, but their cells have no shared house | No. |
Why the connection matters
If the first set uses 6, the second loses every 6. It must use all its remaining digits. The first set is also free to omit 6. If neither set uses it, both sets use all their other digits.