When a chain closes
Difficulty Expert foundationA chain can return to the candidate where it began. The two links that meet there determine what the loop proves. They can settle that candidate or show where other candidates conflict with the loop.
Check the links at the join
Follow the chain back to its starting candidate. Look at the two links that meet there.
Two matching links force the starting candidate
If both links are weak, suppose the candidate is true. The loop forces it false, so remove it. If both links are strong, suppose it is false. The loop forces it true, so place it.
Two matching links at the join
The first three steps show a weak-link join. The last two use a different grid with a strong-link join.
Find the two weak links
A-B=C-AA is the 5 in R3C2. Row 2 needs a 5 in B at R2C1 or C at R2C3. A sees both in box 1.
An alternating join strengthens each weak link
If the links alternate even at the join, choose any weak link. Follow the rest of the loop between its ends. That path starts and ends with strong links, so at least one end is true.
The weak link prevents both ends from being true. Remove any candidate that conflicts with both. Other weak links can give other removals.
A loop with alternating links at every cell
R4C1 and R4C2 both allow only 2 and 7. Look at the links inside the cells and along row 4.
Choose the weak link between the 7s
(2)r4c1=(7)r4c1-(7)r4c2=(2)r4c2-(2)r4c1The two cells share row 4, so at most one of the two 7s is true.
| Links at the start | What the chain proves |
|---|---|
| Two weak links | Remove the starting candidate. |
| Two strong links | Place the starting candidate. |
| One of each | Exactly one end of each weak link is true. |