BUG+1
In BUG+1 every open cell is bivalue except one with three candidates. After checking the full BUG pattern and assuming a unique solution, place the extra candidate in that cell.
What it is
BUG stands for Bivalue Universal Grave. Every open cell has exactly two candidates, and every missing digit has exactly two candidate positions in each of all 27 units: the nine rows, nine columns and nine boxes. In BUG+1 exactly one cell has three candidates. Removing one particular candidate from that cell only in your reasoning must leave this complete BUG pattern. In a Sudoku guaranteed to have a unique solution, that extra candidate must be placed. Any solution of the pure BUG pattern would have a second solution: switching to the other candidate in every open cell preserves every affected unit. Use complete, correctly derived candidates; two notes per cell alone do not prove a BUG. A pure BUG is incompatible with exactly one solution, not automatically unsolvable.
How to spot it
Check all open cells: exactly one pivot must have three candidates, and all the others exactly two. Find the pivot candidate that occurs exactly three times in each of its row, column and box, including the pivot itself. Count those three units separately, not occurrences across the whole grid. Remove that candidate only in your reasoning: every missing digit must then have exactly two candidate positions in every one of the 27 units. Only if the full invariant holds and uniqueness is guaranteed may you place that candidate in the pivot.
Worked example
One question per step: check all open-cell candidates, identify the pivot, verify its three unit counts and the full 27-unit invariant, then place the extra candidate under guaranteed uniqueness.
Step 1 of 4: Check the pairs
Check every open cell. All but the pivot have two candidates. This is only the cell-count check; BUG+1 also needs the candidate counts in every unit to match.
Why it matters
BUG+1 offers a direct placement late in a puzzle when the complete candidate pattern meets its conditions. It is a specialist tool, not a shortcut for every grid with two notes per cell. Learn singles and pairs first, and use it only when uniqueness is guaranteed.
Practise now
Recognise and apply the technique in a matching practice position.
Frequently asked questions
Why does a complete BUG contradict uniqueness?
A complete BUG has exactly two candidates in every open cell and exactly two positions for every missing digit in each row, column and box. If this candidate pattern had a solution, switching to the other candidate in every open cell would give a second solution. Two candidates per cell alone are not enough for this proof.
Is one three-candidate cell enough for BUG+1?
No. Also check that removing one candidate only in your reasoning leaves a complete BUG pattern. Before removal, that candidate occurs three times in each of the pivot’s row, column and box; all other missing digits have two positions per unit. The placement is justified only with this full pattern and a unique solution. The extra candidate is not necessarily the largest or the last candidate written down.
Put it to use
Where you will meet it
Use your candidate notes to look for this pattern in an Expert grid. Its availability depends on the position, not only the difficulty label.
Play ExpertStuck on a grid of your own?
Enter the position in the solver. It explains the safe steps it finds with supported techniques and stops if it cannot prove further progress. It may not use this particular technique.
Open the solverPrefer paper? Ready-made Expert sets as a PDF.Print puzzles
Finished reading? Mark it done and the learning path remembers where you got to.