Generator
The four letterings a small map refuses
A generator in the what it costs to know library, called 6 times across 1 essay. Below: what it draws with nothing specified and with the settings the essays give it, what it checked while drawing, and everywhere it is used.
map-windows is one function. Everything below was drawn by it when the site was
last published, at settings 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.
With nothing specified
view: "refused"
view: "forced"
view: "exact"
What it checked while it drew
Collected while it drew, not written by hand. The count is how many separate times that claim was put to the test.
- a map 2 cells across has no refused lettering at any length — 2 by 2 none of 8 ×3
- a 4 by 3 map has 17 creases and 6 interior vertices, and exactly 2^11 = 2048 letterings pass every vertex ×1
- a sampled 6 by 6 lettering refused through a window exists to draw ×1
- a three-by-three map has 256 letterings that pass every vertex, and the loop test refuses exactly 4 of them ×1
- each of the four is unchanged by a quarter turn of the map: they are pinwheels ×1
- every refusal on three by three, four by three and five by three is a refused three-by-three window, and four by four is the first map with refusals no window explains — 64 of 2112 ×1
- on the sampled maps most refusals are a refused window — 91% on 6 by 6, 90% on 8 by 8, 93% on 10 by 10 ×1
- the four-by-four map has letterings the loop test refuses with every window accepted ×1
- the lettering drawn passes every vertex, is refused as a whole, and has no refused window ×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.
All the figures · The what it costs to know field · The patterns a reader can fold