Advanced family · 06

Almost Locked Sets

Candidate groups that are one digit away from becoming locked, then connected to force deductions.

The ALS family

ONE MISSING CONSTRAINT CAN TURN A CANDIDATE GROUP INTO A POWERFUL LOGICAL NODE

An Almost Locked Set is a group of N unsolved cells in one house whose combined candidates contain exactly N + 1 different digits. A bivalue cell is the smallest ALS, while eight unsolved cells with nine candidates in a house form the largest.

An ALS cannot make any elimination on its own, but that extra candidate is what makes the set useful. If one candidate is removed from the ALS, the remaining candidates become locked into its cells. Restricted Common Candidate can then connect two or more ALS to force deductions via unrestricted common candidate.

The question: Which candidate relationship becomes forced when an almost-locked group loses one of its possibilities?

A useful foundation

ALS TECHNIQUES ARE BUILT FROM RESTRICTED COMMON CANDIDATES.

A Restricted Common Candidate (RCC) is a number shared by two ALS where every occurrence of that number in one ALS sees every occurrence in the other. The two ALS therefore cannot both have that number.

That restriction lets you reason about what must happen inside the sets without deciding which individual cell will receive the number.

Start with ALS-XZ. Then use the same vocabulary to understand the WXYZ-Wing and VWXYZ-Wing.