UVWXYZ-Wing

A UVWXYZ-Wing is an 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 a restricted common candidate X: every X occurrence in one set sees every X occurrence in the other, so X cannot occur in both sets. Any other shared digit Z can be eliminated from an outside cell that sees every Z occurrence in both sets.

What is a UVWXYZ-Wing?

An almost locked set (ALS) consists of k unsolved cells in a single house — a row, column or box — whose combined candidates contain exactly k+1 distinct digits. A UVWXYZ-Wing is the six-cell, six-digit specialization of the ALS-XZ rule: together, its two ALSs contain exactly six distinct cells and six distinct candidate digits. For non-overlapping ALSs, the possible cell-count splits are 5+1 — a five-cell ALS and a bivalue cell; 4+2 — a four-cell ALS and a two-cell ALS; or 3+3 — two three-cell ALSs. This walkthrough uses the 5+1 form. Other two-ALS constructions may still satisfy the ALS-XZ rule, but they are not UVWXYZ-Wings unless they contain exactly six distinct cells and six distinct candidate digits.

Walkthrough example

A walkthrough of one UVWXYZ-Wing: two almost locked sets joined by a restricted common candidate, proving a shared digit in at least one set.

Step 1

Consider these 6 cells.

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

Step 2

The six cells I2, I3, I5, I7, I8, C8 form a UVWXYZ-Wing. The five cells I2, I3, I5, I7, I8 form ALS A: five cells with 6 distinct candidate values. The bivalue cell C8 is the one-cell ALS B. Every occurrence of 9 in ALS A sees its occurrence in ALS B, so 9 is their restricted common candidate (RCC) (I2, I3, I5, I7 don't contain 9, so they are not directly targeted below, but they still count as part of the almost locked set). - If 9 is in ALS A, ALS B loses its degree of freedom and becomes a locked set containing 4. - If 9 is in ALS B, ALS A loses its degree of freedom and becomes a locked set containing 4. - If 9 is in neither set, both ALSs become locked sets containing 4. Either way, 4 is guaranteed to be present in ALS A or ALS B.

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

Step 3

Therefore at least one Wing occurrence of 4 must be true. An external candidate 4 can be removed if it sees every Wing occurrence of 4; whichever occurrence is true would otherwise conflict with it.

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

This walkthrough illustrates the 5+1 form of a UVWXYZ-Wing: a five-cell ALS and a bivalue ALS sharing a restricted common candidate X and another digit Z. X cannot appear in both sets, so Z must occur in at least one — that confinement is what justifies removing Z from any candidate that sees every Z occurrence in both sets. You can try our free Sudoku puzzles to practise with the current candidate state visible.

How to spot it

Identify ALS A and ALS B whose cells total exactly six and whose union holds exactly six distinct digits. List each set’s candidates and find a shared digit X for which all X occurrences in A see all X occurrences in B. Then find another shared digit Z. A proposed target is valid only when it sees every Z occurrence in both sets. Do not require every cell in one ALS to see every cell in the other.

The logic

X cannot occur in both ALSs, so at least one ALS does not use X. Without X, that ALS has exactly as many remaining candidate digits as cells and must use every one of them, including Z. Therefore Z occurs in at least one of the two ALSs. Any outside cell that sees every Z occurrence in both sets cannot contain Z.