BUG+1 (Bivalue Universal Grave)
BUG stands for Bivalue Universal Grave: a position in which every unsolved cell has exactly two candidates and every candidate appears exactly twice in each row, column and box it can still go in. Such a position never has exactly one solution, so a proper puzzle never reaches it. In BUG+1 the board is one candidate away from that grave: every unsolved cell has two candidates except one cell with three, and one of those three digits appears three times in that cell's row, column and box. That digit is the one that keeps the board out of the grave, so the three-candidate cell must be that digit. Like the Unique Rectangle, BUG+1 relies on the puzzle having one solution. It is an Expert technique in Bare Sudoku.
When to use it
Late in a puzzle, when nearly every empty cell is down to two candidates and the usual techniques have stopped. If exactly one cell has three candidates and all others have two, test for BUG+1 before trying chains.
How to spot it
Count candidates: every unsolved cell must have two, except one cell with three. In that cell's row, column and box, count how often each of its three digits appears. Two of them appear exactly twice in each of those units; the third appears three times. That third digit is the answer for the cell. If more than one cell has three candidates, or a cell has four, the simple BUG+1 does not apply.
Example
| c1 | c2 | c3 | c4 | c5 | c6 | c7 | c8 | c9 | |
|---|---|---|---|---|---|---|---|---|---|
| r1 | 2 | 8 | 6 | 59 | 7 | 1 | 34 | 39 | 45 |
| r2 | 35 | 9 | 35 | 4 | 2 | 8 | 6 | 1 | 7 |
| r3 | 4 | 7 | 1 | 3 | 56 | 69 | 2 | 89 | 58 |
| r4 | 59 | 3 | 2 | 6 | 45 | 49 | 8 | 7 | 1 |
| r5 | 7 | 14 | 45 | 15 | 8 | 2 | 9 | 6 | 3 |
| r6 | 19 | 6 | 8 | 19 | 3 | 7 | 5 | 4 | 2 |
| r7 | 13 | 14 | 7 | 8 | 9 | 5 | 34 | 2 | 6 |
| r8 | 6 | 5 | 9 | 2 | 1 | 34 | 7 | 38 | 48 |
| r9 | 8 | 2 | 34 | 7 | 46 | 1 | 5 | 9 |
Bold digits are given, blue digits were placed while solving, small digits are candidates. Highlighted cells form the pattern, crossed-out candidates are removed, and a circled candidate is the digit to place.
- Every unsolved cell has exactly two candidates except r9c6, which has three: 3, 4, 6.
- In row 9, column 6 and box 8, digit 4 appears three times as a candidate. Every other candidate appears exactly twice in each unit where it can still go.
- If r9c6 were not 4, it would have two candidates like every other cell, and the board would be a Bivalue Universal Grave, which never has exactly one solution. The puzzle has one solution, so that cannot happen.
- So r9c6 is 4. Remove 3, 6 from it, and the cell is solved.
Common mistakes
- Applying it when two cells have three candidates, or one cell has four. BUG+1 needs exactly one extra candidate on the whole board.
- Picking the wrong digit of the three. The answer is the digit that appears three times in the cell's row, column and box.
- Using it on a puzzle that may have several solutions. Like every uniqueness technique, BUG+1 only works when the puzzle has exactly one solution, as every Bare Sudoku puzzle does.
In Bare Sudoku
Needed from level: Expert
In the game, the hint says: BUG+1
Play this puzzle · Play Sudoku · Sudoku solver
Practice puzzles
In these puzzles, BUG+1 is the hardest technique you need. Each link opens the puzzle in the game; the solver link shows every step.
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
- Expert 5.6 · Sudoku solver
Frequently asked questions
What does BUG+1 mean in Sudoku?
BUG is short for Bivalue Universal Grave, a position where every empty cell has two candidates and every candidate appears twice in each unit. Such a position cannot have exactly one solution. BUG+1 is that position plus one extra candidate, and the extra candidate must be true.
Why can't a Bivalue Universal Grave have one solution?
It can be shown that when every unsolved cell has two candidates and every candidate appears twice in each unit, the position has either no solution or at least two, never exactly one.
Is BUG+1 guessing?
No. It is a logical step that uses one extra fact: the puzzle has exactly one solution. Bare Sudoku only generates such puzzles.
What if two cells have three candidates?
Then the simple BUG+1 does not apply, and other techniques, such as chains, are needed.
Previous technique: WXYZ-WingAll techniquesNext technique: X-Chain