A generator in the rigid folding library, called 6 times across 2 essays. Below: what it draws at its defaults and at the arguments the essays give it, what it checked while drawing, and everywhere it is used.
reachable-states is one function. Everything below came out of it during this
build, at arguments taken from the essays rather than invented for this page — so a figure
here is the same figure a reader meets in an essay, and when the generator changes, this
page changes with it.
At its defaults
cases: [60,90, 30,120, 45,45, 50,70, 80,55]
cases: [60,90, 45,45]
cases: [30,120, 80,55, 45,45]
What it checked while it drew
Collected by running this generator with a listener on the assertions, not written here.
The count is how many separate times this build put that claim to the test.
5 vertices are compared, each between what the theorems allow and what the linkage reaches ×3
at least one vertex reaches strictly fewer states than the enumeration allows, which is the gap between existence and reachability the figure exists to show ×1
every state the linkage actually reaches is one the combinatorial enumeration allows — the motion never escapes the theorems ×1
Where it is called
Changing this generator changes every figure on this list, which is what makes the list
worth publishing rather than keeping in a check script.