Almost Locked Sets (ALS-XZ)
Two nearly locked candidate groups share a restricted digit, allowing a second shared digit to be eliminated outside both sets.
What it is
An Almost Locked Set, or ALS, consists of N empty cells in the same row, column or box with exactly N+1 distinct candidate digits between them. The N cells need different values, so exactly one of those digits is unused within the set. In ALS-XZ we consider two ALS with no shared cell. They share digits X and Z. X is restricted: every possible X cell in the first ALS sees every possible X cell in the second. Both ALS therefore cannot use X at the same time. If Z is absent from one ALS, that ALS must use all its other N digits, including X. Z cannot be absent from both ALS. An outside Z candidate is impossible if its cell sees every possible Z position in both ALS. We remove that candidate; we do not yet place a digit. No uniqueness assumption is needed.
How to spot it
Start with the compact sets used in these lessons: two to four empty cells in the same row, column or box. Count the distinct digits across all their candidate lists, not the individual notes: N cells must have N+1 digits between them. Find two ALS with no shared cell and at least two shared digits. In our examples, X has just one possible position in each ALS; those two X cells must see each other, meaning they share a row, column or box. The general RCC rule also allows multiple X positions, provided every position in one ALS sees every position in the other. A single cell with two candidates is also an ALS; these drills focus on sets of two to four cells. Look for a target outside both sets that still has candidate Z and sees every Z position in both ALS. Only then does this deduction allow you to remove Z.
Worked example
One question per step: identify the first ALS, compare the second, verify their restricted shared candidate, then remove the one outside candidate that both sets exclude.
Step 1 of 4: Identify the first ALS
The first ALS is in row 4: 4/1, 4/2, 4/3, 4/8. Its 4 cells contain 5 distinct candidates between them: 2/3/5/6/7. That is exactly one more digit than cells.
Why it matters
ALS-XZ is a compact way to expose hidden structure in dense candidate regions. It is advanced because the sets are not obvious by shape, but the finished proof is still local and solution-independent: two sets, one restricted bridge and a fully specified target set.
Practise now
Recognise and apply the technique in a matching practice position.
Frequently asked questions
What makes a set almost locked?
N empty cells in the same row, column or box form an ALS when they contain exactly N+1 distinct candidates between them. The N cells must receive different values. Exactly one of those N+1 digits is therefore unused within the set; we do not yet know which one.
What is the restricted common candidate?
A restricted common candidate, or RCC, is a shared digit X for which every possible X cell in the first ALS sees every possible X cell in the second. The two ALS cannot both use X at the same time. The examples here have exactly one X position per ALS; the general rule can include several.
Why are only some outside Z candidates removed?
The target must be outside both ALS, have candidate Z and see every Z position in both ALS. Otherwise this ALS-XZ deduction does not prove that Z is impossible there. Another technique may still eliminate the candidate.
Put it to use
Where you will meet it
Use your candidate notes to look for this pattern in an Expert grid. Its availability depends on the position, not only the difficulty label.
Play ExpertStuck on a grid of your own?
Enter the position in the solver. It explains the safe steps it finds with supported techniques and stops if it cannot prove further progress. It may not use this particular technique.
Open the solverPrefer paper? Ready-made Expert sets as a PDF.Print puzzles
Finished reading? Mark it done and the learning path remembers where you got to.