Game of Life vs Cellular Automaton: What’s the Difference?
Conway’s Game of Life is a specific, famous 2D cellular automaton — but "cellular automaton" is a much broader family that includes 1D rules, 3D grids and hundreds of other behaviours. Compare both live.
🧪 Try both simulations
⚡ Quick answer
Conway’s Game of Life is one specific cellular automaton (2D, rule B3/S23). "Cellular automaton" is the general class of grid-based rule systems it belongs to — Wolfram’s 1D elementary automata, Rule 30, and 3D variants are all cellular automata too, just with different grids and rules.
📊 Game of Life vs 1D Cellular Automata — Wolfram
| Game of Life | 1D Cellular Automata — Wolfram | |
|---|---|---|
| Relationship | A single, famous example of the class | The general mathematical family that includes Game of Life |
| Grid dimensionality | 2D grid of cells | 1D (this page’s example: Wolfram elementary rules), but the family also covers 2D, 3D and hexagonal grids |
| Rule used | Fixed rule: a live cell with 2–3 neighbours survives, a dead cell with exactly 3 neighbours is born (B3/S23) | Any of 256 possible 1D elementary rules (Rule 30, 90, 110, 184, etc.), each producing very different behaviour |
| State per cell | Binary: alive or dead | Binary in the elementary case, but automata can have any finite number of states |
| Typical behaviour | Gliders, oscillators, still lifes, spaceships — emergent "life-like" patterns | Ranges from simple repetition to Sierpiński-triangle fractals (Rule 90) to provably Turing-complete chaos (Rule 110) |
| Best for learning | Emergence, self-organisation, Turing completeness of simple rules | How rule choice alone determines order vs. chaos in a system |
| Also called | Conway’s Life, "Life" | Wolfram automata, elementary CA, 1D/2D/3D CA |
When people say "cellular automaton", they are almost always picturing Conway’s Game of Life — it’s the most famous instance and the reason the field became popular in the 1970s. But it is only one point in an enormous space of possible rule systems. This site’s Game of Life simulation lets you toggle cells, watch gliders and oscillators emerge, and even switch between Conway, HighLife and Day & Night rule variants in 3D.
The 1D Cellular Automata simulation, by contrast, explores Stephen Wolfram’s full catalogue of 256 "elementary" rules on a single row of cells. Rule 30 generates apparent randomness good enough for cryptographic PRNGs; Rule 90 draws a perfect Sierpiński triangle; Rule 110 is proven Turing-complete. Comparing the two side by side shows how the same underlying idea — a grid, a neighbourhood, and a rule — can produce either a specific beloved simulation or an entire universe of qualitatively different behaviours depending on dimensionality and rule choice.
Want to explore more? Browse the full library of 1000+ interactive, browser-based simulations, or see other side-by-side comparisons.