Unique Loop Type 3
This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. A Type 3 Unique Loop starts from a candidate state in which swapping two digits across the construction would preserve every touched row, column and box. The rescue alternatives act as one virtual slot that completes a subset restriction in a shared house.
What is Unique Loop Type 3?
This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. First verify the complete two-value structure: an even loop of unsolved cells sharing the same two base digits, with exactly two loop cells in every house it touches. Exchanging those digits around the loop must move no given and must leave each affected house with one occurrence of each base digit. Type 3 then applies its additional rescue condition; an arbitrary even cycle is not enough.
In Type 3 the rescue alternatives act as one virtual slot. Combined with companion cells in a shared house they complete a subset restriction on a counted digit union, which is removed from the other eligible cells.
Walkthrough example
A walkthrough of one Unique Loop Type 3: the rescue alternatives act as a virtual slot completing a subset restriction in a shared house.
Step 1
Consider these 6 cells.
Step 2
Assume this puzzle has exactly one solution and that its current candidates reflect sound deductions. The cells C4, C6, H6, H1, I1, I4 form a potential deadly Unique Loop on 2 and 7. If every one of these cells were restricted to 2 and 7, the two alternating allocations would preserve each touched row, column and box while leaving the givens fixed. Exchanging one allocation for the other would therefore prevent a unique completion. The stated uniqueness assumption requires the indicated extra candidates or additional restriction to break this deadly state. Either H1 or I1 must supply one of the escape values 5 and 1. That guaranteed choice acts as one virtual slot for 5 and 1. Together with the real companion cells G3, the virtual slot locks those values into this block; neither rescue cell is counted twice.
Step 3
The red candidates for 5 and 1 can therefore be removed from this block. They lie outside the virtual escape slot, its real companion cells, and the alternate rescue cell.
This walkthrough shows one valid example of the defined construction. Confirm the complete deadly structure, every touched house, and the rescue or guardian condition on each target before applying the same deduction to another grid. You can try our free Sudoku puzzles to practise with the current candidate state visible.
How to spot it
Verify an even loop in which each affected house contains exactly two loop cells and the two base digits can be exchanged around the loop. The rescue alternatives in the rescue cells form one virtual slot. Combine that slot with N−1 real companion cells in a shared house whose candidate union contains N digits. Count each cell once and remove the union only from other eligible cells.
The logic
Uniqueness guarantees that at least one rescue cell uses an extra digit, so the rescue group occupies one virtual slot. Together with the verified companion cells it reserves the stated digit union; only candidates outside that combined set are elimination targets.