Sudoku Chains: XY-Chain and Beyond

The Core Concept: Strong Links, Weak Links, and Alternating Inference

At its heart, a chain is built on two types of connections between candidates: strong links and weak links. A strong link means if one candidate is false, the other must be true. In Sudoku, this often appears as the last two possible positions for a digit in a row, column, or box. A weak link means if one candidate is true, the other must be false. This is a standard candidate elimination rule; two of the same digit cannot be in the same unit.

The power of a chain comes from alternating these links. You start with a premise (e.g., candidate X is false). A strong link then forces another candidate Y to be true. A subsequent weak link then forces a third candidate Z to be false, and so on. This alternating inference chain creates a domino effect. The final deduction at the chain's endpoint often allows you to eliminate candidates from cells that 'see' both ends.

XY-Chains: Extending the Logic of the Y-Wing

An XY-Chain is a sequence of bivalue cells (cells with exactly two candidates) connected by shared digits. It is a direct generalization of the Y-Wing pattern, which is essentially an XY-Chain of length three. In an XY-Chain, each link is a strong link on a shared candidate between two bivalue cells.

For example, cell A has candidates {X,Y}. It is linked to cell B because they share candidate Y, and B is a bivalue cell {Y,Z}. Cell B then links to cell C via shared candidate Z, where C is {Z,W}, and so on. The chain continues until you reach a final cell. The key elimination rule: any cell that can 'see' (is in the same row, column, or box as) both the starting cell's X and the ending cell's final candidate cannot contain either of those digits. This is because the chain logic proves that one of those two endpoint digits must be true somewhere along the chain.

• Look for networks of bivalue cells as potential chain material.
• The shared candidate between two linked cells is the 'pivot' that transfers the logical inference.

X-Cycles: Chains Focused on a Single Digit

While XY-Chains use multiple digits across bivalue cells, X-Cycles (or Simple Coloring) build chains using only one candidate digit at a time. This technique maps out the strong and weak links for a single digit across the entire grid. You mark conjugate pairs (strong links) for that digit and then follow the alternating inferences.

An X-Cycle that forms a closed loop (where the chain returns to its starting point) can yield powerful eliminations. If the loop has an even number of links, it creates a stable pattern where candidates can be assigned to one of two colors. All candidates that see two candidates of the same color can be eliminated. If the loop has an odd number of links, it creates a contradiction, proving that the starting candidate must be false.

How to Build and Spot a Chain

Start by scanning the grid for bivalue cells, especially those that seem connected. For an XY-Chain, pick a promising bivalue cell as your starting point. Look for another bivalue cell that shares one of its candidates. That shared candidate forms the first link. Then, look at the other candidate in this new cell and find the next bivalue cell that shares it.

Continue this process, mentally tracing the path. The goal is to find a chain where the two endpoint cells share a 'target' cell. If a cell can see the first candidate of your starting cell and the last candidate of your ending cell, you have found a valid XY-Chain elimination. For X-Cycles, start by identifying all conjugate pairs (strong links) for a stubborn digit and draw lines connecting them to visualize the network.

• Practice on puzzles known to require chains. Our How to Solve Hard Sudoku guide recommends a progression.
• Use pencil marks accurately. Missing a candidate will break the chain logic.
• Don't force it. If a chain path dead-ends, try starting from a different bivalue cell.

When Are Chains Necessary?

Chains are the defining techniques for expert and diabolical-level Sudoku puzzles. They become necessary when the puzzle resists all simpler, pattern-based strategies like pointing pairs, X-Wing, swordfish, and even the Y-Wing. At this stage, the puzzle offers no obvious 'subset' or 'fish' pattern, and the solver must use chained logic to connect distant inferences.

Our hint engine data shows that players most often get stuck just before the chain-solving phase. The grid will typically have many bivalue cells but no immediate placements. This is the prime environment for XY-Chains and X-Cycles. Mastering these techniques is the final step to solving the most challenging published puzzles.