All 256 rules of one-dimensional cellular automata — watch complexity emerge from simple rules.
Elementary cellular automata (ECA) are the simplest class of one-dimensional cellular automata. Conceived and extensively studied by Stephen Wolfram in the 1980s and documented in his landmark book A New Kind of Science (2002), they demonstrate how extraordinarily complex behavior can emerge from the simplest possible rules.
The setup is deceptively simple: a row of cells, each either alive or dead. To compute the next generation, each cell looks at itself and its two neighbors (3 cells total). Since each cell has 2 states, there are 2³ = 8 possible neighborhood patterns. A rule assigns an output (alive or dead) to each pattern. With 8 binary choices, there are 2⁸ = 256 possible rules — and that is the complete universe of elementary cellular automata.
Wolfram classified all 256 rules into four behavioral classes:
Rule 30 is perhaps the most famous elementary cellular automaton. Despite its trivially simple definition, it produces output that is statistically indistinguishable from random noise. Wolfram used Rule 30 as the random number generator in Mathematica for years. Remarkably, the same pattern appears in nature: the pigmentation on cone snail shells (genus Conus) closely matches Rule 30's output, suggesting that biological pattern formation may follow cellular automaton-like rules.
In 2004, Matthew Cook proved that Rule 110 is Turing complete — meaning it can, in principle, compute anything a general-purpose computer can. This was a landmark result: the simplest possible one-dimensional rule system that supports universal computation. Rule 110 exhibits Class IV behavior, producing gliders and localized structures that interact in ways complex enough to encode arbitrary computations.
Rule 90 produces a perfect Sierpinski triangle (also known as Sierpinski's gasket) when started from a single cell. This fractal pattern, with its self-similar structure at every scale, emerges purely from the local rule — no global coordination, no fractal formula. It is equivalent to computing XOR of the two neighbors, making it one of the few rules with a clean mathematical characterization.
Rule 184 models traffic flow and ballistic annihilation. Alive cells move to the right, and when two meet they can annihilate or jam. It has been used as a simplified model in traffic engineering and particle physics.
Elementary cellular automata are the one-dimensional cousins of Conway's Game of Life, which operates on a two-dimensional grid with a slightly more complex rule set. Both demonstrate the same fundamental insight: complex, unpredictable, even computational behavior can emerge from the simplest local rules applied uniformly. Where the Game of Life has gliders, oscillators, and spaceships in 2D, elementary automata achieve analogous phenomena in a single dimension — making them easier to analyze while retaining the core mystery of emergence.
From simple rules to complex behavior — the same principle drives Tactiko's AI. Basic movement rules on a small grid create deep, emergent football tactics that surprise even their creators.
Play Tactiko