BUG (Bivalue Universal Grave)
Assuming a unique solution: if every empty cell is bivalue except one trivalue cell, and every candidate has the required even house counts except one extra digit, that cell must hold the extra digit.
How it works
- 1Picture the whole board looking like this box: every empty cell is down to exactly two candidates except B2, which still carries three, and every row, column and box has the BUG parity — each live digit appears twice, except one extra digit in B2's three houses.
- 2That's BUG+1. Under the puzzle's unique-solution assumption, leaving the extra digit unused would reduce the grid to a Bivalue Universal Grave whose candidates can swap into two completions.
- 3Count each of B2's candidates inside the box: 3 appears twice and 7 appears twice, but 4 appears three times — at A1, B1 and B2 itself.
- 4The odd count is what breaks the tie, so B2 must be the 4.
- Where the conclusion lands