BUG Type 1

This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. In BUG Type 1, one trivalue cell contains a single guardian candidate whose hypothetical removal would leave the full BUG structure. The guardian must be true, so the other two candidates in that cell can be removed.

What is BUG Type 1?

The premise is more than “all cells bivalue except one.” After hypothetically removing the guardian candidate, every unsolved cell must be bivalue and each remaining digit must occur exactly twice in every row, column, and box where it occurs. That is the BUG structure excluded by uniqueness.

A single trivalue cell is the usual Type 1 exception. One of its three candidates is the guardian: removing that one hypothetically produces the verified BUG structure. The guardian must stay and becomes the cell’s value; the other two, non-guardian candidates are removed.

Walkthrough example

A walkthrough of one BUG Type 1: a single trivalue exception cell in an otherwise all-bivalue state; its guardian candidate stays and the other two are removed.

Step 1

Assume this puzzle has exactly one solution and that its current candidates reflect sound deductions. Consider these unsolved cells.

Sudoku grid showing step 1 of the BUG Type 1 walkthrough, with the unsolved cells of the BUG state highlighted.

Step 2

Every highlighted cell has exactly two candidates except I9. Its guardian candidate 7, marked on the grid, is what prevents the BUG.

Sudoku grid showing step 2 of the BUG Type 1 walkthrough, with the guardian candidates marked.

Step 3

Suppose 7 were removed from I9, as marked on the grid. Then every unsolved cell would be bivalue, and every remaining candidate would occur exactly twice in each row, column and box where it appears. This is the BUG structure excluded by the stated unique-solution assumption.

Sudoku grid showing step 3 of the BUG Type 1 walkthrough, the hypothetical BUG state after removing the guardian candidates.

Step 4

Therefore I9 must take its value from the guardian candidate 7; otherwise the BUG would remain. Its other candidates, 5 and 9, can be removed from I9.

Sudoku grid after the BUG 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 play Sudoku online to practise with the current candidate state visible.

How to spot it

Find the lone trivalue cell, then test each possible guardian by removing it hypothetically and checking the entire BUG occurrence structure. When exactly one removal produces the BUG state, that removed candidate is the guardian. Keep it and remove the other two candidates from the cell.

The logic

If the guardian were false, the remaining candidate state would be a BUG and would not support a unique completion. Under the stated uniqueness assumption, the guardian must therefore be true. The candidates removed from the exception cell are the two non-guardian candidates, not the guardian itself.