hop-ladder
Drawn at its defaults, in which hop the rule keeps.
It carries a slider over lattice, so the claim in its caption strip is
restated at every stop rather than at one.
It takes no options at all, so every essay calling it gets this exact drawing.
Called by 4 essays
the blast radius of changing it
A file has to close
The three destinations counted with a shared factor sit near a half turn, a half turn and two thirds. Measuring how near is the trap: by distance from the fraction, the golden angle is closer to two fifths than two of them are to anything, and would be reported as having five files it does not have.
Where the angle comes fromA survivor has to be a neighbour
A stem that never repairs after a removal keeps exactly one lattice hop rigid, and nothing predicted which one. Sweep every offset at twelve lattices and the answer narrows sharply: at twenty-nine of thirty the surviving hop is one of the two families a counter returns, and the one exception is a step six times too long to be one.
Where the angle comes fromNot the shorter of the two
If a damaged stem keeps one contact family standing, the obvious guess is that it keeps the nearer one. Across thirty wrecked offsets that is true twelve times and false seventeen, and on one lattice the two steps differ by a quarter of a per cent — where the words shorter and longer are doing no work at all.
Where the angle comes fromOne offset, two answers
Which contact family a wrecked stem keeps is decided by where the cut landed, at twenty-five of thirty offsets, by the simplest rule anybody would write down. It is refuted by two runs: the same counted pair, the same offset, two different rises, and two different surviving families.