BUG+1
Difficulty HardIn a BUG+1, removing one candidate leaves a grid whose remaining choices come in interchangeable pairs. Any solution of that reduced grid has a partner. A puzzle with exactly one solution must use the extra candidate.
Find the cell with three candidates
Look for one empty cell with three candidates and exactly two candidates in every other empty cell.
In the three-candidate cell, find the digit with three possible places in its row, three in its column, and three in its box.
Imagine removing that digit. Every empty cell must now have two candidates. In each row, column, and box, every missing digit must have exactly two possible places.
If those counts hold across the grid, the removal leaves a Bivalue Universal Grave (BUG). Switching every originally empty cell to its other choice turns any solution of that grid into a second one. Place the extra digit in the three-candidate cell.
Examples
Example 1 ready.
R1C5 is the only empty cell with three candidates. 9 occurs three times in each of its three houses.
Suppose R1C5 loses 9. Each empty cell then has two choices. Every missing digit has two places in each house that needs it. Swapping the choices gives a second solution. This puzzle has one solution, so the cell needs 9.
Place 9 in R1C5.
Trainer
Difficulty HardFind one digit you can place.
See also
Some example positions come from HoDoKu regression library.