OpenWorldLab

Loading interactive view…

Complex Systems & Emergence

Cellular Automata Lab

Simple rules on a grid can produce chaotic waves, self-replicating crystals, avalanches of every size and universal computers. This guide covers the six families in this simulator: how their rules work and why they behave as they do.

The six families

Pick one to read how it works, then launch it. Each rule also has its own page.

Two states, eight neighbours

Conway's Game of Life and its relatives

How the rule works

Every cell is either alive or dead. It counts how many of the eight cells touching it are alive; that single number decides what it becomes next. All cells update simultaneously, using the state of the grid before the step.

B<birth counts> / S<survival counts>

Conway's rule is B3/S23: a dead cell with exactly three live neighbours comes alive, and a live cell with two or three neighbours stays alive. Everything else ends up dead. Changing those two lists gives you the other 262,143 rules in the family.

Why this one rule got famous

Conway settled on B3/S23 in 1969 because it was the only variant he tried that did neither of the two boring things: die out immediately, or fill the plane. That balance makes room for gliders (shapes that travel), oscillators (shapes that repeat in place) and, eventually, logic gates built out of colliding gliders. Life is Turing complete: in principle it can compute anything a computer can.

  • HighLife (B36/S23): one extra birth condition, and a twelve-cell pattern that copies itself every twelve steps.
  • Seeds (B2/S): nothing survives its own turn, so everything on screen is a chain reaction.
  • Life Without Death (B3/S012345678): cells are born normally and never die, growing a permanent maze.

Loading interactive view…

Controls

ActionKeyWhereWhat it does
Play / pauseSpaceBottom dockStarts and stops the simulation.
Single step.Bottom dockAdvances one step. Use it when something interesting is about to happen.
Draw1PencilPaint cells on the canvas. Multi-state rules add a colour picker beside it.
Erase2EraserClears cells under the brush. Removes ants in the turmite rules.
Stamp a pattern3Stamp iconPlaces a known pattern with a live preview. Life-like and Generations rules only.
Grid linesGGrid iconShows cell boundaries. Needs a cell scale of 3px or more.
RandomiseRSoupFills the grid at random. For the sandpile it drops several piles instead; for turmites it randomises the paint and leaves the ants alone.
ClearCTrash iconEmpties the grid. Turmite ants are kept where they are.
Speed, scale, boundaries—Settings (sliders icon)Steps per second, pixels per cell, brush size, and whether the grid edges wrap or act as walls.

Common questions

What is a cellular automaton?

A grid of cells, each holding a state: alive or dead, a colour, or a count. At every tick, all the cells work out their next state at the same moment from their neighbours’ states. Nothing coordinates them from above; every pattern on the canvas comes from those local exchanges.

Are turmites cellular automata?

Strictly, no. Turmites (like Langton’s ant) are Turing machines on a two-dimensional tape: a single active head moves over a passive grid of colours, rather than every cell updating simultaneously. They are included because their history and behaviour (order → chaos → highway) are usually studied alongside cellular automata.

What makes Conway’s Game of Life so famous?

John Conway tested dozens of candidate rules in 1969 to find one where populations neither died out immediately nor exploded to fill the plane. That narrow balance lets structures collide, bounce, shoot gliders and act as logic gates, which makes Life Turing complete: in principle it can compute anything a computer can.

Why does Rule 110 matter?

Rule 110 is one of the simplest systems known to be Turing-complete. Matthew Cook proved in the 1990s, in a paper published in 2004, that its colliding gliders can simulate a cyclic tag system, a stripped-down universal computer. So a one-dimensional rule whose whole definition fits in eight bits can compute anything a modern computer can.

Can I design my own rules?

Yes. Use the Try any rule explorer below to type custom birth/survival counts (e.g. B35/S236) or enter any 1D rule number from 0 to 255. You can also paste patterns in the standard RLE (run-length encoded) format into the Presets window in the top bar.

More from OpenWorldLab