Off Lattice · Gliders on the Hat and Spectre Tilings · Glider census
The glider census
thirty-two travelling objects under four rules
The discovery paper (arXiv:2609.22579, with an interactive essay) found a glider under each of four rules: three rules on the hat tiling, called hat A's, hat B's and hat C's after their gliders, and one rule on the spectre tiling. The certificate paper (Certificates of Immortality for Gliders on the Hat and Spectre Tilings, arXiv link to follow) proves that those gliders travel forever, by giving each one a certificate. The census asks what else the four rules carry.
It launched 13,153 small seeds under the four rules and ran the same proof on every travelling object that settled out of them. Thirty-two objects have certificates. Each one flies in a live viewer on the pages below.
Each number is the count of situations in an object's certificate, which is how the census names it, and links to the object's viewer. A prime marks a second object with the same count.
The pages
- Single gliders Seventeen gliders. Hat A's and hat B's rules carry the same five in different alphabets, and hat C's rule carries five of its own.
- Convoys Fifteen larger objects: pairs of gliders flying in formation, pairs that lock together, and gliders that carry a few extra cells.
- The second spectre lane family The spectre rule's two gliders leave one seed 9° apart, towards the major and minor corners of the ball around it.
- Showers and ash Seeds that burst into many gliders, and one under hat C's rule that is still launching them after 1,500 generations.
How the census was made
Seeds. Under each rule the census took three tiles of every tile class, spread across a patch of radius 384. At each tile it tried every two-tile seed: the tile and a neighbour that shares an edge with it, in each of the nine combinations of the three live states. That is 2,538 seeds for each hat rule and 1,539 for the spectre rule. To these it added 1,000 random seeds per rule, each of six cells in random states close to a random tile.
Settling. Each seed ran for 150 generations. By then 9,195 of the seeds had died out or run into the edge of the patch. Another 632 had too many live cells or too many separate pieces to follow one at a time. These are the showers: 562 under hat C's rule and 70 under the spectre rule. The other 3,326 had launched one or more separate travelling objects.
Certifying. Each travelling object was followed for up to 300 generations. The procedure of the certificate paper collects every situation the object passes through, where a situation is the pattern together with the tiles around it. It then checks every way the tiling can continue ahead of each situation. If the rule always takes a situation in the set to another situation in the set, and the pattern never dies, the set is a certificate and the object travels forever. The certificate also gives a window that contains the object's long-run heading and a lower bound on its speed.
Naming. Two objects are the same only if their certificates are the same set of situations. Objects that look alike can therefore be different objects. Objects are named by the size of their certificates.
What the census found
- Hat A's and hat B's rules carry the same five single gliders. Remove the state-3 cells of a hat A glider and rename its other two states, and it becomes the matching hat B glider, situation for situation. The 638 formation pairs of the two rules match in the same way.
- Hat C's five gliders are not hat A's under any renaming of states.
- Every hat object has the same certified heading window to within 0.0003° and the same speed bound. The spectre rule has two families of directions, 9° apart.
- No pair flies in file. The two gliders of every formation pair travel side by side or in echelon.
- Bound pairs were found only under hat A's rule, and gliders with passengers only under hat B's.
What the census does not show
- The seeds were small. Larger seeds, or seeds built by hand, may launch objects that are not listed here.
- Only the four rules of the discovery paper were tried.
- An object is listed only if its certificate closed. Inside a shower the gliders are too close together to follow one at a time, and some fragments could not be certified. Under hat C's rule 88 such fragments were two gliders travelling together. None of them certified, so the census cannot say whether hat C's rule has a formation pair.
- Showers are not certified as a whole, and objects that stay in one place, such as the small oscillators of hat C's rule, are not in the table. The showers page follows a few showers and one oscillator.
- The counts of launches on the object pages come from a smaller first pass, of 188 seeds per hat rule and 114 for the spectre rule. They depend on the choice of seeds.
- A certificate is a proof about one object. The census is a search: an empty cell in the table means that the search found no such object, and the rule may still have one.
All thirty-two objects
Data and code
Every viewer has a button that downloads the record it is replaying and shows the command that replays it. The records, the census tables and the code are in the public repository, github.com/jamesedmond/monotile-ca:
results/certificates/census3/holds the census tables, one row per seed with what it launched, and the logs of the runs.results/certificates/census-objects.jsonlandcensus-seeds.jsonlhold the records the viewers fly.census-two-lanes.jsonlandcensus-showers.jsonlhold the records of the second-lane and showers pages.results/certificates/census-certificates.tsvlists, for each of the 32 objects, the command that rebuilds its certificate from its record, and the certificate's situation count, heading window, speed bound and signature. A rebuild takes about a minute once the atlas of the tiling has been generated.crates/certify/census/rebuild_certificates.pyruns all 32 and compares them with the table.results/certificates/*.jsonare the certificates published with the certificate paper, among them those of the discovery paper's gliders and of the second spectre glider.crates/certifyis the certificate procedure. Itscensuscommand regenerates the census tables.