UVWXYZ-Ring

A UVWXYZ-Ring is a double-linked ALS-XZ construction involving exactly six distinct cells and six distinct candidate digits across two almost locked sets. For non-overlapping sets, the cell-count split is 5+1, 4+2 or 3+3. The sets share two different restricted common candidates, X and Y. These restrictions make both ALSs resolve into locked sets. Here, “Ring” refers to the double-linked ALS pair, not to an AIC ring.

What is a UVWXYZ-Ring?

Each ALS consists of k unsolved cells in one house with exactly k+1 distinct candidate digits. Together, the two ALSs contain exactly six distinct cells and six distinct candidate digits. For non-overlapping sets, the possible cell-count splits are 5+1, 4+2 or 3+3. They share two different restricted common candidates: for each of those digits, every occurrence in one ALS must see every occurrence in the other. A restricted common candidate may occur only once in an ALS; multiple occurrences are not required.

Walkthrough example

A walkthrough of one UVWXYZ-Ring: two almost locked sets joined by two restricted common candidates that lock both sets.

Step 1

Consider these 6 cells.

Sudoku grid showing step 1 of the UVWXYZ-Ring walkthrough, with the relevant candidates and cells highlighted.

Step 2

The 6 cells I7, I8, G9, H9, I9, I1 form a double-linked UVWXYZ-Wing (ALS-XZ with 2 RCCs). The 5 cells I7, I8, G9, H9, I9 form ALS A (holding candidates 1, 2, 3, 4, 5 and 6), and the bivalue cell I1 is ALS B. The digits 1 and 6 are two restricted common candidates (RCCs): every occurrence in ALS A sees its occurrence in ALS B. Each ALS has 1 degree of freedom and can support at most one RCC, so the two RCCs split between the sets — one per ALS. Follow 1: - If 1 is in ALS A, ALS B (I1) cannot contain it and becomes a locked set containing 6. - If 1 is in ALS B (I1 is 1), ALS A cannot contain it and becomes a locked set containing 2, 3, 4, 5 and 6 — 6 among them. There is no third case: 1 must be in one of the two sets, so both ALSs resolve simultaneously into locked sets and the 6 Ring cells contain each value 1, 2, 3, 4, 5 and 6 exactly once.

Sudoku grid showing step 2 of the UVWXYZ-Ring walkthrough, with the relevant candidates and cells highlighted.

Step 3

Under the ALS-XZ Double Link rule ({2 RCC}): - Each RCC (1 and 6) can be eliminated from any cell seeing all its occurrences across both ALS A and ALS B. - Any non-RCC digit confined to one ALS can be eliminated from cells seeing all its occurrences within that ALS. Therefore, remove all marked candidates.

Sudoku grid after the UVWXYZ-Ring deduction, with the justified placement or eliminations highlighted.

This walkthrough illustrates the 5+1 form of a UVWXYZ-Ring: a five-cell ALS and a bivalue ALS sharing two restricted common candidates. The two links lock both sets, so every digit of the construction is used exactly once — that saturation is what justifies removing each marked digit from a candidate that sees all of its occurrences in the Ring cells. You can play sudoku online to practise with the current candidate state visible.

How to spot it

List ALS A and ALS B — six cells and six distinct digits in total — and verify two separate restricted commons. For an RCC elimination, check visibility to all relevant occurrences across both sets. For another digit locked in one ALS, check visibility to every occurrence of that digit in that particular ALS. Do not replace these occurrence tests with a rule about seeing every cell in the ring.

The logic

Whichever restricted common is used by one ALS, the other allocation is forced so that both ALSs become locked. Restricted-common candidates can be removed from cells that see all of their relevant occurrences across the sets. A non-RCC digit can be removed from a cell that sees all of its occurrences in the individual ALS that must contain it.