How many pieces each printed pattern's letterings fall into
folding-pieces 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
view: "cut", pattern: "square-twist"
view: "cut", pattern: "hexagon-twist"
view: "shelf", trials: 24
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.
- 107 of 862 moves the printed patterns admit survive the conditions, and 0 of those change a buried crease ×1
- 120 steps taken from one lettering of the the miura fold and the buried letters never moved ×1
- 120 steps taken from one lettering of the the waterbomb tessellation and the buried letters never moved ×1
- 32 rules, 32 of them in different pieces, out of 262144 pieces the patch has ×1
- cutting a buried crease of the the hexagon twist takes it from 64 pieces to 8 ×1
- cutting a buried crease of the the square twist takes it from 16 pieces to 2 ×1
- each cut is one crease's assignment changed to a raw edge, and every consequence is recomputed from the pattern rather than predicted ×1
- each repeating rule is a lettering of the whole patch, so it has a place in the same space every other lettering has ×1
- every node of the straight skeleton is equidistant from each edge that defined it, so one fold serves them all — 1 checked ×1
- every pair of creases meeting at an interior vertex is flipped and the whole pattern re-checked, so a surviving move is one the conditions really allow ×1
- the buried creases are counted from the pattern's own graph, so the piece count is predicted before any lettering is drawn ×1
- the crumple's own lettering is the one the folding wrote, and its buried creases are counted from the pattern the folding produced ×1
- the draws are independent solutions of the same constraint problem with the branch order randomised, so two of them landing in one piece is a collision and not a repeat ×1
- the walk is the folder's own procedure — find a move, take it — and what is watched is whether the buried letters ever change ×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.
A cut is not local
Cutting one crease of a square twist takes its letterings from sixteen mutually unreachable pieces to two. The cut crease is one of the four that were settled when the pattern was drawn — and it takes two others with it, because the vertices it releases were the far ends of those. Even a cut along a crease that was never settled quarters the count.
The decision a crumple has taken
A sheet crumpled at random satisfies every condition in the subject, because it just folded. It also wrote itself a lettering — one of very many the pattern admits — and it is now in a piece of that space it cannot leave: at six folds a crumpled sheet carries thirty-nine buried creases, which is half a million million million pieces, and every change it admits stays inside one of them.
The pieces without the list
The letterings a pattern folds in fall into pieces no folder can cross, and the count was found by writing every lettering down — which stops at eighteen creases. The Miura has thirty-eight, the Yoshimura eighty-six, and the number of pieces can be read off the drawing without listing anything: four million and two hundred and eighty-one million million.
Thirty-two rules, thirty-two pieces
The waterbomb tessellation's surviving repeating rules fold to one object — same panels, same places, same areas. Put them in the space of letterings the patch admits and they occupy thirty-two different pieces of a quarter of a million, so no two of them can be reached from one another without unfolding the sheet.
Every generator · The flat-folding field · The patterns a reader can fold