About the Game of Life
The mathematician, the rules, the famous patterns, and why a grid of cells changed how we think about computation.
John Conway — The Mathematician
John Horton Conway (1937–2020)
John Conway was a British mathematician born in Liverpool who became one of the most playful, inventive, and celebrated mathematicians of the twentieth century. A professor at Cambridge and later at Princeton, he made major contributions across combinatorial game theory, group theory, number theory, geometry, and recreational mathematics.
In 1970 he was working on a problem posed by John von Neumann: could you define a simple set of rules for an idealized machine that could reproduce itself? Conway’s answer was the Game of Life — published in Martin Gardner’s Mathematical Games column in Scientific American (October 1970). It became one of the most famous mathematical discoveries of the century and sparked an entire field of research into cellular automata.
Conway died on April 11, 2020, from COVID-19 — just months after the 50th anniversary of the Game of Life. His legacy in recreational and theoretical mathematics is impossible to overstate. He reportedly disliked that GOL was his most famous contribution, feeling it overshadowed his deeper mathematical work. And yet — GOL may have taught more people to think about computation than any other single idea.
The Four Rules
Each cell in the grid is either alive or dead. At each generation, every cell examines its eight neighbours and applies exactly four rules:
Famous Patterns
Decades of exploration have catalogued thousands of named structures. The four canonical categories are:
Block & Beehive
Stable configurations that never change. A 2×2 Block is the simplest still life; a Beehive is the smallest six-cell still life. They satisfy survival rule (2–3 neighbours) for every cell, every generation.
Blinker & Pulsar
Patterns that cycle through a fixed set of states. The Blinker (period 2) alternates between a horizontal and vertical bar of 3 cells. The Pulsar (period 3) is the most common period-3 oscillator and is hypnotically symmetric.
The Glider
Oscillators that move across the grid. The Glider is the smallest and most famous spaceship: a 5-cell pattern with period 4 that travels diagonally, one cell per 4 generations. Discovered by Richard K. Guy in 1970. It is the unofficial symbol of hacker culture.
Gosper Glider Gun
Patterns that periodically emit other patterns. Bill Gosper’s Glider Gun (1970) was the first known infinite-growth pattern — it produces a new Glider every 30 generations, forever. Gosper won a prize Conway had offered for the first such discovery.
Why GOL Matters in Computer Science
Turing Completeness
In 2002, Paul Rendell demonstrated a working Turing machine implemented inside a Game of Life grid. This means GOL can, in principle, perform any computation that any computer can perform. Four rules. Two cell states. Arbitrary computation. This is one of the most remarkable results in theoretical computer science.
Emergence
GOL is the defining classroom example of emergence: complex, unpredictable macro-level behavior arising from simple micro-level rules. No individual cell “knows” it is part of a Glider. The Glider exists only at the pattern level — it is a property of the system, not of any individual component. The same principle explains consciousness, traffic jams, ant colonies, and economic markets.
Cellular Automata
GOL belongs to the family of cellular automata (CA) — discrete models where computation occurs on a regular grid. CA theory, developed partly in response to GOL, now underlies models of fluid dynamics, biological pattern formation, traffic flow, epidemiology, and cryptography. Stephen Wolfram’s A New Kind of Science (2002) argued that cellular automata may be the most fundamental model of nature.
Programming Education
GOL is an ideal programming exercise at every level: beginners learn 2D arrays, nested loops, and conditional logic; intermediate students explore object-oriented cell representations and optimised generation algorithms; advanced students tackle infinite grids, sparse representations, and the Hashlife algorithm (exponentially faster by memoizing patterns). It is complex enough to be interesting and simple enough to be finished.
How to Use This App
Loading an initial population:
- Click Random Fill to populate the grid with approximately the set percentage of live cells. Adjust this in Settings.
- Click any individual cell to toggle it alive or dead.
- Use Drag: Add mode to paint live cells by clicking and dragging across the grid.
- In the Explore page, select a named structure from the dropdown and right-click on the grid to place it.
Running the simulation:
- Click Start to run continuously. The button toggles to Pause mid-run.
- Click Step to advance exactly one generation at a time.
- Population, generation count, and time interval are shown below the controls.
- The grid background turns pink when paused — you can edit cells while paused.
Settings (gear icon):
- Random percentage — controls how densely packed the random fill is.
- Reproduction interval — controls the speed in milliseconds between generations.
GOL Structures Reference (Wolfram) • S.P.A.R.K. Chat Log — the story of this upgrade
Last update: