XY-Chain

Difficulty Very Hard

An XY-Chain passes from one two-candidate cell to the next through a digit they share. When both ends point to the same digit, at least one end must hold it. A cell that sees both ends cannot hold it.

Connect cells with two candidates each

Choose a cell with two candidates. Suppose one digit is false. Its other digit must then be true.

Find a two-candidate cell that sees the first and shares that forced digit. The shared digit is false in the new cell, so its other digit must be true. Repeat through the chain.

Stop when the forced digit in the last cell matches the digit you first supposed false. One end must contain that digit. Remove it from other cells that see both ends. An XY-Wing uses three cells this way.

Examples

Example 1

Example 1 ready.

Follow the links from 6 in R6C5 to 6 in R7C1.

Suppose R6C5 cannot be 6. The first strong link forces 9 in R6C5. The alternating links then force 6 in R7C1. Either end rules out 6 in R7C5.

Remove 6 from R7C5.

Strong link. At least one is true.Weak link. At most one is true.

Trainer

Difficulty Very Hard

Walkthrough

Use Pencil mode to remove a candidate.

See also