Local interactions

Three rules. Endless universes.

In 1970, John Conway put down three rules for cells on a grid. Fifty years later, people are still finding surprises hidden in them.

A cell is alive or dead. Each step every cell counts its 8 Moore neighbours and updates itself using three lines of rules:

That's it. That's the whole game. What comes out of these three rules is astonishing: still lifes, oscillators, spaceships that move across the grid, patterns that emit new patterns forever, and — proven in 2000 — a full universal Turing machine. This is emergence, the canonical demonstration that arbitrary complexity can hide inside arbitrarily simple local rules.

Pick a pattern · hit play · watch three rules produce a universe

Generation
0
Live cells
0
Peak population
0
most ever alive
Status
🎨 Draw mode

🖱 Click any cell to toggle it — or drag to paint. Newly born cells glow orange; cells that have survived a while settle into blue. Toroidal edges (top wraps to bottom, left to right) mean gliders keep circling forever.

Try 🌰 Acorn. Seven cells. Set speed to 30/s and press play. This little seed produces over a thousand generations of chaos before it settles down at generation 5206 — when it finally quiets, it has left behind 41 stable objects and thrown 13 gliders off into space. Or try 🔫 Gosper glider gun: the first pattern proven to grow forever, and how Bill Gosper won Conway's original $50 prize in 1970.

A much quieter cellular automaton

Same grid. Same 8-cell Moore neighbourhood. One tiny rule change: instead of Conway's 2/3 survival rule, each cell just copies whichever value most of its neighbours hold. That's it. Local majority wins. Let's watch it play out.

Watch consensus solidify into stable clusters

Step
0
Blue share
50%
Blue clusters
—
fewer = more consensus
Cells flipped
0
stops changing when 0

Try a fresh start at low density (say 25%) — the minority side gets absorbed almost entirely. Try 50% — the grid crystallises into a small handful of large regions. Try 75% — mirror image of the low-density outcome. Consensus is always local, never global.

Two automata. One neighbourhood. Two worlds. Both simulators above use the exact same 8-cell Moore-neighbourhood update; only the update rule differs. Conway's Life is class 4 on Wolfram's cellular-automaton scale — complex, unpredictable, Turing-complete. Local Majority is class 2 — always settles to a stable clustered fixed point. The difference between "eternally surprising" and "predictably boring" is literally three lines of code.

Where these show up

Related models

← Schelling segregation Entropy →