BUG Type 3
This deduction assumes the puzzle has exactly one solution and that all earlier candidate removals were sound. BUG Type 3 begins with a verified BUG candidate structure and combines its guardian alternatives with other cells in a shared house to make a subset-style restriction. The guardian alternatives act as a virtual slot; they are not ordinary independent subset cells.
What is BUG Type 3?
First identify the guardian candidate group whose complete removal would create the BUG state. In a shared house, combine that guaranteed group with N−1 real cells so that the relevant candidate union has N digits. Count every actual cell once and keep the guardian cells distinct from ordinary subset members.
Type 3 combines the guaranteed guardian alternatives with a subset restriction in a shared house. The alternatives together occupy one virtual slot; they are not ordinary independent subset cells. Add the required number of separate companion cells, count the candidate union exactly, and eliminate only from other eligible cells in that house.
Walkthrough example
A walkthrough of one BUG Type 3: guardian alternatives act as a virtual slot completing a subset restriction in a shared house.
Step 1
Assume this puzzle has exactly one solution and that its current candidates reflect sound deductions. Consider these unsolved cells.
Step 2
The cells F7 and H7 contain the extra BUG candidates 4 and 7, marked on the grid. Removing all those marked candidates would leave the deadly BUG structure.
Step 3
Suppose the BUG candidates 4 and 7 were removed from F7 and H7, as marked on the grid. Every unsolved cell would then 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.
Step 4
To avoid the BUG, at least one of F7 and H7 must contain one of 4 and 7. That guaranteed escape acts as one virtual slot for the values 4 and 7. Together with the real companion cells E7, it locks those values into row 7. The marked occurrences outside these eligible positions can therefore be removed.
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
Verify the underlying BUG counts, identify the guardian alternatives, and then count the companion cells and digit union in their shared house. Do not call three ordinary cells a Naked Pair or eliminate from a guardian cell using the ordinary outside-subset rule.
The logic
Uniqueness guarantees that at least one guardian alternative is true, so the group occupies one virtual slot in the combined restriction. The companion cells occupy the remaining slots. Candidates in the resulting digit union can be removed only from other eligible cells in the shared house.