One flap the packing does not place
held-and-free 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
n: 7
n: 9
n: 8, view: "packing", ns: [5, 6, 7, 8, 9, 11, 13, 14]
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.
- held-and-free: the annealed packing of 7 discs does not beat the published optimum, which it never consults ×4
- the tightest arrangement of 9 discs this repository can find leaves no discs free to move ×3
- the freest of them can travel 0.1127 of the sheet's own width without anything overlapping ×1
- the tightest arrangement of 7 discs this repository can find leaves 1 disc free to move ×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.
The flap nobody holds
An optimal packing is presented as an answer: here are the circles, here is where they go. For some numbers of flaps that is not what it is. The best arrangement of seven discs in a square leaves one of them free to wander over an eleventh of the sheet without changing the answer at all — and the algorithm reports one point of that region and stops.
The shapes the optimum has
Requiring a circle packing to be its own mirror image halves the number of coordinates a search has to find, so the same effort covers a much smaller space. Whether that helps depends on something the search cannot know in advance — whether the best packing was symmetric — and measured flap count by flap count the answer alternates without a pattern anybody could use.
Two packings, one radius
A packing search reports a number, and the number is not the design. What a crease pattern is built from is the graph of which discs touch which — and at five and six flaps, runs of the same search that agree about the best radius to four decimal places come back with contact graphs that are provably not the same graph. The answer an optimiser gives has not determined the pattern it is supposed to have found.
Every generator · The designing a base field · The patterns a reader can fold