Unique Loop Type 4
This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. A Type 4 Unique Loop starts from a candidate state in which swapping two digits across the construction would preserve every touched row, column and box. A conjugate restriction on one base digit inside the rescue cells’ shared house removes the other base digit from both.
What is Unique Loop Type 4?
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 4 then applies its additional rescue condition; an arbitrary even cycle is not enough.
In Type 4 a house shared by two rescue cells has one base digit confined to those cells. That locks the digit into the rescue cells, so the other base digit is removed from both.
Walkthrough example
A walkthrough of one Unique Loop Type 4: one base digit locked into the two rescue cells removes the other base digit from both.
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 B4, I4, I6, C6, C9, B9 form a potential deadly Unique Loop on 2 and 8. If every one of these cells were restricted to 2 and 8, 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. Note that the two cells C9 and B9 are the only possible positions of the value 2 in this block, thus, one of these two cells will contain the value 2.
Step 3
Therefore, the only possible way to avoid the two configurations is if neither C9 nor B9 contains the value 8. The value 8 can therefore be removed from cells C9 and B9.
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 start a free Sudoku game 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. In a house shared by the rescue cells, one base digit is restricted to those cells. That restriction prevents the other base digit from occupying either rescue cell; do not claim the individual allocation of the locked digit unless another deduction proves it.
The logic
The locked base digit must occur in one rescue cell. If the other base digit occupied either rescue cell, the remaining base digits could complete the forbidden exchange. Therefore remove the other base digit from both rescue cells; the locked digit’s exact cell may remain unresolved.