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

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

What the census does not show

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: