XY-Chain
A longer chain of bi-value cells. Linked pairs force a shared endpoint digit, which can be eliminated from cells seeing both ends.
What it is
An XY-Chain is a sequence of unsolved cells, each with exactly two remaining candidates. Consecutive cells see each other: they share a row, column or box. The link between them uses a common candidate. Inside each cell, the chain switches from the incoming candidate to the other candidate. Both endpoints contain the same endpoint candidate. If it is absent at the first endpoint, that cell must contain its other candidate. This excludes that candidate from the next cell, forcing the other member of its pair. Following these implications forces the endpoint candidate at the far end. At least one endpoint must therefore contain it. Remove it only from other cells that see both endpoints. The chain proves those eliminations, not a particular placement at either end.
How to spot it
Start with an unsolved cell whose notes show exactly two remaining candidates. Choose one as the endpoint candidate and follow the other into a cell that sees the start cell. Switch to the other candidate there, then link it to another visible bi-value cell. Do not reuse a cell. When the chain ends with the original endpoint candidate, look outside the chain for cells that still have that candidate and see both endpoints. Only those cells lose it. Matching endpoint digits alone are not enough: every link and every switch within a cell must be valid. Without a target cell, this chain gives no elimination.
Worked example
One question per step: find the first pair, follow the shared candidate through every link, compare the matching ends, then remove their shared candidate where both are seen.
Step 1 of 4: Find the first pair
Start at r4c5 (row 4, column 5) with candidates 2 and 4. For the proof, suppose r4c5 is not 2. It must then be 4. This is a case to check, not a final placement.
Why it matters
XY-Chains turn small bi-value relationships into longer, controlled deductions. They are especially useful when no compact wing is available, while still relying on candidate pairs that can be checked one link at a time.
Practise now
Recognise and apply the technique in a matching practice position.
Frequently asked questions
Must consecutive cells in the chain see each other?
Yes. Each consecutive pair must share a row, column or box as well as a candidate; otherwise the candidate cannot force the next link in the chain.
Which candidate can be eliminated?
The candidate present at both endpoints. It can be removed only from a cell that sees both endpoint cells, because the chain guarantees that at least one endpoint must contain it.
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.