Following a chain
Difficulty Very Hard foundationA chain follows what one candidate implies about the next. It can show that at least one of two distant candidates is true. Anything that conflicts with both can then be ruled out.
Read a chain from one end
Find a strong link between two candidates. From its far end, look for a weak link to another candidate that has a strong link.
One forced step at a time
Call the four candidates A, B, C, and D. The example connects them in this order with a strong link, a weak link, and a strong link.
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.
| Step | Reason | Result |
|---|---|---|
| A to B | Strong link | B is true. |
| B to C | Weak link | C is false. |
| C to D | Strong link | D is true. |
Suppose A is false. The links force B true, C false, and D true. Either A is true or D must be true. You can remove any candidate that conflicts with both.
The two ends can both be true. A chain like this only rules out the case where both are false.
Colors record a relationship
Two colors can mark opposite choices along links where exactly one end is true. A weak link alone permits both ends to be false, so it cannot establish opposite colors.