On an arc the candidates are its start, every grid step
(hingedArmSwivel.STEP) inside it and its end. A candidate with a
neighbour either side that neither neighbour is ahead of, and that is
ahead of one of them, is a local minimum and is refined
(hingedSwivelSwept.sweep's rule); the refinement's probes are held
inside the arc, since a swivel outside it is not a candidate, which
leaves the score continuous and its minima on the arc unchanged. An
arc's end has one neighbour and is a candidate only: a minimum at an end
is the end itself. An arc a full turn wide is the circle, its steps
neighbours round the turn and its refinement unheld, which is the full
sweep of one branch.
The choice is folded over the visited arcs in the order given, each
arc's candidates in swivel order with a minimum's refinement after its
step, so the first of equals is the full sweep's wherever the arcs cover
its candidates.
The best candidate over the arcs.
On an arc the candidates are its start, every grid step (
hingedArmSwivel.STEP) inside it and its end. A candidate with a neighbour either side that neither neighbour is ahead of, and that is ahead of one of them, is a local minimum and is refined (hingedSwivelSwept.sweep's rule); the refinement's probes are held inside the arc, since a swivel outside it is not a candidate, which leaves the score continuous and its minima on the arc unchanged. An arc's end has one neighbour and is a candidate only: a minimum at an end is the end itself. An arc a full turn wide is the circle, its steps neighbours round the turn and its refinement unheld, which is the full sweep of one branch.The choice is folded over the visited arcs in the order given, each arc's candidates in swivel order with a minimum's refinement after its step, so the first of equals is the full sweep's wherever the arcs cover its candidates.