BUG-Lite Sudoku: Deadly Patterns With More Than Two Digits

What Is a BUG-Lite Pattern?

A BUG-Lite occurs when a grid reaches a state where all unsolved cells have exactly two candidates except for a specific set of cells that have three. This set is not isolated to a single cell or a simple rectangle. Instead, the cells with extra candidates are connected, and those extra candidates involve more than two digits total, forming a loop. The pattern's name comes from it being a 'lite' or partial Bivalue Universal Grave state.

In a full BUG, every unsolved cell would be bivalue, creating an unavoidable set that would yield two valid solutions. A BUG-Lite is a deadly pattern because it represents a subset of the grid that is on the verge of creating such a non-unique situation. The rule is simple: to preserve the puzzle's single solution, you must place at least one of the extra candidates from the loop. This placement breaks the symmetry of the deadly pattern.

How BUG-Lite Differs from BUG+1

BUG+1 is a simpler pattern where only one cell in the entire grid holds three candidates, while all other unsolved cells are bivalue. That single cell's extra candidate is the solution, as placing either of its other two digits would create a full BUG. The Sudoku BUG Technique for BUG+1 is therefore a direct placement.

BUG-Lite is more complex. Here, multiple cells have three candidates, and they are linked. The extra candidates in these cells are not all the same digit; they come from a loop involving three or more digits. This means the logic is not about a single cell's extra candidate being true, but about the necessity that at least one candidate from the entire loop must be true to avoid a deadly pattern. It's a generalization of the uniqueness principle applied to a network of cells.

• If only one cell has three candidates, you're likely looking at BUG+1.
• If multiple linked cells have three candidates from a mix of digits, suspect a BUG-Lite.

Why the Uniqueness Assumption Forces a Placement

All standard Sudoku puzzles are designed to have one unique solution. The core principle behind uniqueness techniques like BUG-Lite is that you can assume your puzzle is valid. If a candidate placement would lead to a pattern known to produce multiple solutions (a deadly pattern), that placement must be false.

A full Bivalue Universal Grave is a known deadly pattern. A BUG-Lite configuration is a subset of the grid that, if all its extra candidates were false, would collapse into a local BUG state. Since a local BUG can often force a non-unique solution globally, we must prevent it. Therefore, the logical consequence is that not all the extra candidates in the loop can be false. At least one must be true. This deduction often allows you to eliminate candidates elsewhere or make a direct placement.

How to Identify and Verify a BUG-Lite Loop

Spotting a BUG-Lite requires a keen eye for candidate symmetry. First, examine the grid for a large set of bivalue cells. Then, look for a smaller set of cells that each have three candidates. These multi-candidate cells should be connected, meaning they share units (rows, columns, or boxes).

Next, check the candidate composition. List all the extra third candidates from these cells. If they come from only two digits, you might be looking at a different pattern, like a Unique Rectangle Type 1. For a true BUG-Lite, the extra candidates should involve three or more different digits, and these digits should appear in a cyclic fashion among the cells. This loop is what creates the deadly potential. Before applying the technique, double-check that all other unsolved cells in the relevant units are indeed bivalue. Misidentifying a cell's candidate count is a common error.

• Use pencil marks diligently. A BUG-Lite is invisible without full candidate notation.
• Trace the loop of extra candidates. They should form a closed chain involving the suspect cells.

Applying the Technique in a Puzzle

Let's consider how uniqueness logic can appear in a solve path, using the provided puzzle which is solved entirely with singles. While this specific grid's solution path doesn't contain a BUG-Lite, we can see where such patterns typically arise. After many placements, the grid often simplifies to many bivalue cells. A solver might pause and scan for any clusters of cells that disrupt perfect bivalue status.

If a BUG-Lite were present, the solver would identify the loop of cells with three candidates. The deduction would be that to avoid a deadly pattern, one of the loop's extra candidates must be correct. This could directly reveal a placement or allow the elimination of other candidates, eventually leading to a Naked Single or Hidden Single. Understanding Sudoku Uniqueness techniques like this provides a powerful last-resort tool when standard strategies like pairs and triples are exhausted.

Common Pitfalls and Misconceptions

A major mistake is confusing BUG-Lite with patterns that have extra candidates in many unrelated cells. The cells must be interconnected in a specific loop. Also, the technique only applies if the puzzle is assumed to have a unique solution. It should not be used in puzzles that explicitly allow multiple solutions.

Another pitfall is forcing the pattern. Not every cluster of tri-value cells is a BUG-Lite. The surrounding bivalue cell condition is strict. If other unsolved cells in the units containing the loop have more than two candidates, the deadly pattern logic does not hold. Always verify the candidate counts thoroughly before making an elimination based on uniqueness.