The 22 boarding phases of the highway of Langton's ant

Langton's ant, started from the empty grid, builds from step 9,977 on a highway of period 104. For an ant started from any finite configuration whose trajectory eventually follows this highway, call onset the first step from which it reads the colors of the highway, and boarding phase the phase of the highway at the step before. We prove that the cell read at that step is never read again, so that the boarding phase is a phase at which the highway reads a cell for the last time. An exact computation over one period gives 22 such phases out of 104, one for each translation class of the cells read by the highway: 15, 20, 23, 24, 25, 29, 30, 71, 82, 89 to 93, and 96 to 103. Conversely, each of them is the boarding phase of finite configurations with every onset of at least 1, by a short construction that uses the reversibility of the dynamics. The necessity can also be derived from a known criterion for periodic highways and an earlier lemma on boarding; the statement on the boarding step, the list of phases and their realization appear to be new. The proofs are elementary, and a self-contained script reproduces the computations.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24224324
Primary Topic
Cellular Automata and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The 22 boarding phases of the highway of Langton's ant

Sylvain Gathellier
Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
preprint

The 22 boarding phases of the highway of Langton's ant

Sylvain Gathellier
preprint en

Abstract

Langton's ant, started from the empty grid, builds from step 9,977 on a highway of period 104. For an ant started from any finite configuration whose trajectory eventually follows this highway, call onset the first step from which it reads the colors of the highway, and boarding phase the phase of the highway at the step before. We prove that the cell read at that step is never read again, so that the boarding phase is a phase at which the highway reads a cell for the last time. An exact computation over one period gives 22 such phases out of 104, one for each translation class of the cells read by the highway: 15, 20, 23, 24, 25, 29, 30, 71, 82, 89 to 93, and 96 to 103. Conversely, each of them is the boarding phase of finite configurations with every onset of at least 1, by a short construction that uses the reversibility of the dynamics. The necessity can also be derived from a known criterion for periodic highways and an earlier lemma on boarding; the statement on the boarding step, the list of phases and their realization appear to be new. The proofs are elementary, and a self-contained script reproduces the computations.

Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon