Almost Locked Sets (ALS) represent one of the most powerful expert-level techniques in Sudoku. While techniques like X-Wing or Swordfish focus on a single digit, ALS works across multiple digits simultaneously, making it exceptionally versatile.
The core idea: find two groups of cells (each an “Almost Locked Set”) that are linked by a shared candidate called the Restricted Common Candidate (RCC). A second shared candidate can then be eliminated from cells that see both ALS.
In this guide you will learn what an ALS is, understand the ALS-XZ elimination rule, walk through a detailed example, and discover how to spot these patterns in your own puzzles.
✅ What Is an Almost Locked Set?
An Almost Locked Set (ALS) is a group of N cells within a single house (row, column, or box) that together contain exactly N+1 different candidates.
N cells, N+1 candidates in one house = Almost Locked Set. If any one of those N+1 candidates were removed, the remaining N candidates would form a perfect Locked Set (Naked Pair, Triple, etc.).
Examples by size:
- 1 cell, 2 candidates: A bivalue cell like R3C5={4,7} is the simplest ALS.
- 2 cells, 3 candidates: For instance R1C1={8,9} and R1C2={1,8,9} in the same row — together they hold {1,8,9}.
- 3 cells, 4 candidates: Three cells sharing four digits — one step above a Naked Triple.
The word “almost” is key: a Locked Set has N cells with N candidates and is fully determined. An ALS has one extra candidate, so it is “almost” locked. This surplus candidate is what makes ALS useful for elimination logic.
You may see Almost Locked Sets abbreviated as ALS. The elimination rule pairing two ALS is called ALS-XZ (or ALS Double). More complex chains using ALS include ALS-XY-Wing, ALS-Chain, and Death Blossom.
🔗 The ALS-XZ Rule
The ALS-XZ rule is the fundamental elimination technique using Almost Locked Sets. It requires two ALS linked by a special candidate.
Given ALS A and ALS B (no shared cells) with a Restricted Common Candidate x, any other common candidate z that appears in both ALS can be eliminated from every cell outside both ALS that sees all z-cells in ALS A and all z-cells in ALS B.
Why it works: Because x is restricted, at most one of the two ALS can keep it. Whichever ALS loses x becomes fully locked (N cells, N candidates). In either scenario, the surviving candidates of that ALS are determined. Candidate z must be in one ALS or the other — it cannot be in any cell that sees all z-cells in both.
In plain language:
- Find two ALS (A and B) with no overlapping cells.
- Identify a shared candidate x whose cells in ALS A all see the x-cells in ALS B (this is the RCC).
- Find another shared candidate z.
- Eliminate z from any cell (outside both ALS) that can see every z-cell in ALS A and every z-cell in ALS B.
🔒 The Restricted Common Candidate (RCC)
The Restricted Common Candidate (RCC) is the linchpin of the ALS-XZ rule. It is the candidate digit labelled x that links ALS A and ALS B together.
Candidate x must appear in both ALS, and every cell with x in ALS A must see every cell with x in ALS B. This means they share a row, column, or box. The visibility constraint ensures both ALS cannot simultaneously keep x.
Typical RCC connections:
- Same column: An x-cell in ALS A and an x-cell in ALS B share a column.
- Same box: All x-cells in both ALS belong to (or see into) the same box.
- Same row: x-cells line up in the same row across the two ALS.
If x had cells in ALS A and ALS B that did not see each other, both ALS could potentially keep x, and the elimination logic would break down.
🔎 Step-by-Step Example
Let’s work through a real ALS-XZ elimination. We will identify two ALS, find the RCC, and eliminate a candidate.
Step 1: Identify ALS A
Look at Row 1. Two unsolved cells in Box 1 form an ALS:
- R1C1 = {8,9}
- R1C2 = {1,8,9}
Together they hold 3 candidates {1,8,9} across 2 cells — that is N=2 cells with N+1=3 candidates. This is ALS A.
Step 2: Identify ALS B
Now look at Row 2. Three unsolved cells form another ALS:
- R2C3 = {3,8}
- R2C4 = {3,9}
- R2C5 = {3,7,9}
Together they hold 4 candidates {3,7,8,9} across 3 cells — N=3, N+1=4. This is ALS B.
Step 3: Find the Restricted Common Candidate (RCC)
ALS A has candidates {1,8,9}. ALS B has {3,7,8,9}. The common candidates are 8 and 9.
Check candidate 8 as the RCC:
- 8 in ALS A: R1C1 and R1C2 (both in Row 1, Box 1).
- 8 in ALS B: only R2C3 (Row 2, Box 1).
- R1C1 sees R2C3 through Box 1 ✔. R1C2 sees R2C3 through Box 1 ✔.
All x-cells in ALS A see all x-cells in ALS B. Candidate 8 is a valid RCC (x=8).
Step 4: Identify the Elimination Candidate (z)
The other common candidate is 9 — this is our z.
- 9 in ALS A: R1C1 and R1C2 (Row 1, Box 1).
- 9 in ALS B: R2C4 and R2C5 (Row 2, Box 2).
Step 5: Eliminate z
Remove candidate 9 from every cell outside both ALS that sees all four z-cells (R1C1, R1C2, R2C4, R2C5):
- R1C4 — sees R1C1 & R1C2 (Row 1) and R2C4 & R2C5 (Box 2) — {3,5,6,
9} → {3,5,6} - R1C5 — sees R1C1 & R1C2 (Row 1) and R2C4 (Col 4... wait — actually Box 2) & R2C5 (Col 5) — {3,6,
9} → {3,6} - R1C6 — sees R1C1 & R1C2 (Row 1) and R2C4 & R2C5 (Box 2) — {3,5,6,
9} → {3,5,6}
Three cells lose candidate 9!
Step 6: Result
After removing candidate 9 from three cells in Row 1, their candidate lists shrink significantly. R1C5 now has only {3,6}, which may enable Naked Pairs or Hidden Singles to make further progress.
Case 1: ALS A keeps 8. Then ALS B loses 8, becoming locked: {3,7,9} over 3 cells = Naked Triple. Digit 9 is confined to ALS B.
Case 2: ALS B keeps 8. Then ALS A loses 8, becoming locked: {1,9} over 2 cells = Naked Pair. Digit 9 is confined to ALS A.
In both cases, digit 9 in these two regions is accounted for — it cannot appear in any outside cell that sees all 9-instances in both ALS.
⚖️ ALS vs. Simpler Techniques
| Technique | How It Works | Difficulty |
|---|---|---|
| Naked Pairs | 2 cells, 2 candidates in one house → eliminate from peers | Intermediate |
| X-Wing | Single digit, 2 rows × 2 columns → eliminate from columns | Advanced |
| XY-Wing | 3 bivalue cells in a hinge pattern → eliminate from common peers | Advanced |
| ALS-XZ | Two ALS linked by RCC → eliminate shared non-RCC candidate | Expert |
| Swordfish | Single digit, 3 rows × 3 columns | Expert |
| Simple Colouring | Single digit, conjugate chains with colour conflicts | Advanced |
ALS-XZ is more powerful than most single-digit techniques because it works with multiple digits at once. An XY-Wing is actually a special case of ALS-XZ where both ALS are bivalue cells.
🕵️ How to Spot ALS-XZ Patterns
Step 1 – Find ALS candidates: Scan rows, columns, and boxes for groups of N cells with N+1 candidates. Start with small ALS (bivalue cells and 2-cell groups).
Step 2 – Look for overlap: Find two ALS that share at least two common candidates.
Step 3 – Check the RCC: For each common candidate, verify that all cells with that candidate in ALS A can see all cells with it in ALS B.
Step 4 – Eliminate z: The other common candidate can be eliminated from cells seeing all z-instances in both ALS.
Practical tips:
- Start small: Bivalue cells are the easiest ALS to spot. Pair a bivalue cell with a 2-cell ALS in an overlapping box for a quick ALS-XZ.
- Focus on box boundaries: The RCC often links through a shared box, so look at cells near box borders.
- Use pencil marks: ALS detection requires complete and accurate candidate lists. Make sure your pencil marks are fully up to date.
- Look at congested areas: Regions with many unsolved cells and overlapping candidates are fertile ground for ALS patterns.
⚠️ Common Mistakes
1. Forgetting the House Constraint
Each ALS must have all its cells in a single house (one row, one column, or one box). An arbitrary collection of cells is not an ALS unless they share a house.
2. Missing the RCC Visibility
The Restricted Common Candidate requires that every cell with x in ALS A sees every cell with x in ALS B. If even one pair doesn’t share a row, column, or box, the RCC is invalid.
3. Eliminating the Wrong Candidate
Only the non-RCC common candidate (z) can be eliminated. The RCC (x) itself is not eliminated — it is the link that makes the logic work.
4. Including Cells from Both ALS in Eliminations
Eliminations only apply to cells outside both ALS. Do not remove z from cells that belong to ALS A or ALS B — those cells are part of the pattern.
5. Incomplete Pencil Marks
ALS detection depends entirely on accurate candidate lists. Missing a candidate or having an extra one leads to incorrect ALS identification and wrong eliminations.
📅 When to Look for ALS
- Basic: Naked Singles, Hidden Singles, Full House.
- Early intermediate: Locked Candidates, Pointing Pairs, Box/Line Reduction.
- Intermediate: Naked Pairs, Hidden Pairs, Naked Triples.
- Advanced: X-Wing, XY-Wing, W-Wing, Skyscraper, Simple Colouring.
- Expert: ALS-XZ, Swordfish, Jellyfish, Unique Rectangles.
Use ALS-XZ when simpler techniques are exhausted. It is one of the last techniques to try before resorting to advanced chains or trial-and-error.
Puzzles requiring ALS-XZ are typically rated Expert or Extreme. Try our hard puzzles for practice with advanced techniques.
🚀 Beyond ALS-XZ
| Technique | What It Adds | Complexity |
|---|---|---|
| ALS-XZ | Two ALS linked by one RCC | Expert |
| ALS-XY-Wing | Three ALS in a wing pattern with two RCCs | Expert+ |
| ALS-Chain | Multiple ALS linked in a chain | Master |
| Death Blossom | A stem cell whose candidates each connect to a different ALS | Master |
| Swordfish | Single-digit pattern across 3 rows/columns | Expert |
| Unique Rectangles | Exploits uniqueness constraint on deadly patterns | Advanced |
ALS-XZ is the gateway to ALS-based techniques. Once you are comfortable spotting two linked ALS, extending to three (ALS-XY-Wing) or longer chains is a natural next step. The underlying logic remains the same: restricted common candidates force one side or the other to lock, and the resulting certainty drives eliminations.
🎯 Practice ALS-XZ
Hard Sudoku
Challenging puzzles where ALS-XZ and other advanced techniques are needed.
▶ Play Hard SudokuXY-Wing Guide
XY-Wing is a special case of ALS-XZ — learn the simpler version first.
▶ Read XY-Wing GuideNaked Pairs Guide
Understanding Locked Sets helps you grasp the “almost” in Almost Locked Sets.
▶ Read Naked Pairs GuideFrequently Asked Questions
An Almost Locked Set (ALS) is a group of N cells within one house (row, column, or box) containing exactly N+1 different candidates. A bivalue cell is the simplest ALS. If one candidate were removed, the set would become fully locked.
Two ALS share a Restricted Common Candidate (RCC) x — a digit whose cells in ALS A all see the x-cells in ALS B. At most one ALS can keep x, forcing the other to lock. Any other common candidate z can then be eliminated from cells that see all z-instances in both ALS.
A Restricted Common Candidate is a digit that appears in both ALS where every cell holding it in ALS A can see every cell holding it in ALS B. This mutual visibility means both ALS cannot keep the digit simultaneously.
ALS-XZ is an expert-level technique requiring solid pencil-marking skills and the ability to recognise Almost Locked Sets across houses. Most solvers learn it after mastering X-Wing, XY-Wing, and similar advanced methods.
Yes. ALS-XZ is one of the strongest single-step techniques and can break through positions where simpler methods fail. Combined with other techniques it can solve nearly any puzzle without trial and error.