Uniqueness of the Classical Langton Ant Highway from Its Layer Profile

Hao Ke

Preprint ·

Abstract

Can the trail left by a periodic Langton ant determine its entire turn sequence? We prove a uniqueness theorem from sparse geometric information about that trail. Consider a periodic trace generated from a finite black seed whose period restores the heading, translates by (2, −2), increases the number of black cells by twelve, and has transverse coordinate x + y spanning ten units. On each interior level of x + y, suppose at most one of the two residue classes modulo this translation is visited an odd number of times per period. Then the period is 104 and the turn sequence is the standard highway, up to cyclic phase. The locations of the odd classes and the period length are derived from these assumptions. The proof first uses parity to restrict the possible layer profiles, then obtains a finite period bound from an integer certificate, and finally exhausts the remaining traces with their chronological visit order preserved. A second part treats the inverse problem with a prescribed wake: for every non-axis drift, a computable period bound makes synthesis terminate. Additional parity tests extend to general non-axis drifts and give a purely analytic exclusion of unit-diagonal full drift.

Citation

Hao Ke (2026). Uniqueness of the Classical Langton Ant Highway from Its Layer Profile. Zenodo. 10.5281/zenodo.23675970

@misc{ke2026langtonsantstandardwake,
  author = {Hao Ke},
  title = {{Uniqueness of the Classical Langton Ant Highway from Its Layer Profile}},
  year = {2026},
  doi = {10.5281/zenodo.23675970},
  url = {https://doi.org/10.5281/zenodo.23675970},
  note = {Preprint, version 0.3.1}
}

CC BY 4.0.