Volume 33, Issue 3 (2024)

Triangular Automata: The 256 Elementary Cellular Automata of the Two-Dimensional Plane

Paul Cousin
Université Paris Cité, France

Abstract

Cellular automata (CAs) in the triangular grid are here called triangular automata (TAs). This paper focuses on the simplest type of TAs, called elementary TAs (ETAs). They are argued to be the two-dimensional counterpart of Wolfram’s elementary CAs. Conceptual and computational tools for their study are presented, along with an initial analysis. This paper is accompanied by the author’s website [1], where the results can be explored interactively. The source code is available in the form of a Wolfram Language package at [2].

Keywords: cellular automata; triangular grid; dynamical systems; complexity

Cite this publication as:
P. Cousin, “Triangular Automata: The 256 Elementary Cellular Automata of the Two-Dimensional Plane,” Complex Systems, 33(3), 2024 pp. 253–276.
https://doi.org/10.25088/ComplexSystems.33.3.253