Unique Loop Type 1

This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. A Type 1 Unique Loop starts from a candidate state in which swapping two digits across the construction would preserve every touched row, column and box. One rescue cell carries extra candidates; it must take one of them, so the two base digits are removed from that cell.

What is Unique Loop Type 1?

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 1 then applies its additional rescue condition; an arbitrary even cycle is not enough.

In Type 1 every loop cell except one is bivalue on the base digits; the remaining rescue cell holds extra candidates as well. Because at least one rescue candidate must be true, that cell cannot hold either base digit.

Walkthrough example

A walkthrough of one Unique Loop Type 1: every loop cell except one is bivalue on the base digits, and the single rescue cell loses both base digits.

Step 1

Consider these 6 cells.

Sudoku grid showing step 1 of the Unique Loop Type 1 walkthrough, with the loop cells highlighted.

Step 2

Assume this puzzle has exactly one solution and that its current candidates reflect sound deductions. The cells D4, G4, G6, F6, F9, D9 form a potential deadly Unique Loop on 4 and 5. If every one of these cells were restricted to 4 and 5, 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.

Sudoku grid showing step 2 of the Unique Loop Type 1 walkthrough, with the base digits and rescue candidates marked.

Step 3

To prevent the deadly state, D9 must use a candidate other than 4 or 5. The values 4 and 5 can therefore be removed from D9.

Sudoku grid after the Unique Loop Type 1 deduction, with the justified eliminations marked.

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. All but one loop cell are bivalue on the base digits; the rescue cell also has extra candidates. Confirm the swap would preserve every touched house before removing the two base digits from that rescue cell.

The logic

If the rescue cell used a base digit, the complete base-digit arrangement would permit the forbidden swap. Under the unique-solution assumption it must use an extra candidate, so the two base candidates can be removed from that cell.