Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane
Abstract
Cellular automata on the triangular grid are here referred to as Triangular Automata (TA). This paper focuses on the simplest class of TA, called Elementary Triangular Automata (ETA). They are argued to be the two-dimensional counterpart of Wolfram's Elementary Cellular Automata. Conceptual and computational tools for their study are presented, along with an initial analysis. This paper is accompanied by a website where the results can be explored interactively. The source code is available in the form of a Mathematica package.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.