ExpertChains and uniqueness

Practise: Almost Locked Sets (ALS-XZ)

Find two separate marked Almost Locked Sets. Which outside 6-note sees every possible 6 position in both sets?

This direct drill begins on two verified Almost Locked Sets. Identify each set, check their restricted shared candidate, then remove only the outside note that sees every matching position.

Example 1 of 4

Remember

Two disjoint ALS share a restricted candidate that appears once in each set and whose two cells see each other. An outside shared candidate can be removed only when it sees every one of its possible positions in both sets.

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 Expert

Stuck 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 solver

Prefer paper? Ready-made Expert sets as a PDF.Print puzzles