Reading chain notation
Difficulty Expert foundationChain notation records a sequence of candidate choices. Each symbol tells you whether ruling out one choice forces the next, or whether placing one rules out the next. The two ends tell you which deduction the chain supports.
Read the two sides of each link
Read the candidate on each side of a symbol. The equals sign marks a strong link. A dash marks a weak link.
| Notation | Read it as |
|---|---|
| (5)r2c3 | 5 in row 2, column 3. |
| A = B | A and B have a strong link. |
| A - B | A and B have a weak link. |
| (2=7)r6c4 | A strong link between 2 and 7 inside R6C4. |
| R8C1 ≠ 5 | Remove candidate 5 from R8C1. |
A chain can switch digits inside a cell
R6C4 allows only 2 and 7. Each candidate is a separate end of the link.
Read (2=7)r6c4
(2=7)r6c4The equals sign marks a strong link inside R6C4. At least one of its two candidates must be true.
Read the implications, not just the symbols
In A = B - C = D, suppose A is false. The strong link forces B true. The weak link makes C false, so the last strong link forces D true.
A pair can have both kinds of link. The symbol tells you which property the proof uses here.
Trace four possible 5s
Rows 1 and 4 each have only two places for 5. The diagram shows the 5s used in the proof.
Read the four ends
(5)r1c1=(5)r1c5-(5)r4c5=(5)r4c2A is R1C1, B is R1C5, C is R4C5, and D is R4C2. The path reads A = B - C = D.
Check the ends separately
Look at the digits as well as the cells at the two ends. A chain can switch digits in the middle. A removal must conflict with both endpoint candidates.
If the path returns to its starting candidate, compare the first and last links at that point.