Conway's Game of Life: How Simple Rules Create Universes

Imagine four simple rules — born, survive, die from loneliness, die from crowding — applied simultaneously to every cell on an infinite grid. Nothing more. And yet from those four constraints, universes bloom: gliders travel endlessly across the void, spaceships race in formation, guns fire endless streams of patterns into empty space, and structures emerge capable of performing any calculation a computer can perform.

This is Conway's Game of Life. And it's one of the most astonishing demonstrations in all of mathematics that complexity doesn't require complicated rules — it requires the right ones.

The Concept

Conway's Game of Life is what mathematicians call a cellular automaton — a model where a universe is divided into a grid of cells, each in one of a finite number of states, and the entire universe updates according to a fixed set of rules applied simultaneously to every cell at each discrete time step.

John Horton Conway, a British mathematician working at Cambridge University in the late 1960s, developed his version between 1968 and 1970. He wanted something with a particular balance: rules complex enough to allow unpredictable behavior, but simple enough to be interesting to study. After experimenting with various rule sets, he landed on four:

1. Underpopulation: A live cell with fewer than 2 live neighbors dies. 2. Survival: A live cell with 2 or 3 live neighbors lives on. 3. Overpopulation: A live cell with more than 3 live neighbors dies. 4. Reproduction: A dead cell with exactly 3 live neighbors comes to life.

Each cell has eight neighbors — the cells directly adjacent horizontally, vertically, and diagonally. All births and deaths happen simultaneously each "generation," or tick. That's it. That's the entire universe.

Conway introduced Life to the world through Martin Gardner's "Mathematical Games" column in Scientific American in October 1970. The response was extraordinary — it generated more reader mail than any previous column Gardner had written. Thousands of people set up graph-paper grids, traced patterns by hand, and mailed in their findings to Gardner.

Why It Matters

The Game of Life sits at a remarkable intersection: it's simultaneously a mathematical curiosity, a philosophical provocation, and a live demonstration of core computer science theory.

It's Turing complete. This means that Conway's Game of Life, with an infinite grid and enough time, can simulate any computation that any computer program can perform. Logic gates, memory registers, counters, conditionals — all can be built from colliding gliders and oscillating patterns. Conway himself provided the theoretical proof in 1982. In 2000, Paul Rendell built a working Turing Machine inside the Game of Life. In 2010, he built a Universal Turing Machine — a computer that can simulate any other computer — inside Life.

Think about what that means: four rules about cells dying and being born, and the result is mathematically equivalent to every computing device ever built.

It models emergence. One of biology's central mysteries is how complex organisms arise from simple cellular interactions. How does a single fertilized egg become a human being, with distinct organs, tissues, and structures, all from the same DNA? Life doesn't answer that question, but it demonstrates that the phenomenon is possible — that local, simple rules can generate global, complex structure without any central planner. Researchers have drawn parallels between Life's patterns and population dynamics, chemical reaction fronts, and neural signaling.

It's a philosophical provocation. Conway designed the rules with a deliberate biological analogy in mind: overpopulation kills, isolation kills, just the right neighborhood allows survival and reproduction. But the deeper question Life poses is whether complexity itself — and perhaps intelligence, and perhaps consciousness — might arise from some sufficiently interesting rule set operating on some sufficiently interesting substrate. We don't know whether we live in something like a cellular automaton. But Conway's game makes that question feel less absurd than it once did.

The Details

Three Families of Patterns

Decades of Life exploration (the game has attracted a global community of hobbyists and researchers since 1970) have catalogued thousands of distinct patterns. They fall into three broad families:

Still Lifes are patterns that never change — each live cell has exactly 2 or 3 neighbors, and no dead cell adjacent to the pattern has exactly 3 live neighbors, so nothing is ever born or dies. The simplest is the Block: a 2×2 square of four cells. The Beehive is a six-cell hexagonal arrangement. These are the stable atoms of the Life universe.

Oscillators return to their original configuration after a fixed number of generations. The Blinker is the simplest: three cells in a row that alternates each tick between horizontal and vertical. The Pulsar — a beautiful, highly symmetrical 48-cell pattern — oscillates with a period of 3. Life is "omniperiodic," meaning oscillators exist for every possible integer period — a remarkable result, with the final missing periods only confirmed in recent years.

Spaceships are patterns that repeat their configuration but have shifted position — they translate across the grid. The most famous is the Glider, a five-cell pattern discovered by Richard K. Guy. It moves one cell diagonally every four generations. It's the smallest and most common spaceship, fitting in a 3×3 bounding box, and it plays a central role in everything interesting that follows.

The Gosper Glider Gun: Unbounded Growth

When Conway introduced the Game of Life in 1970, he conjectured that no pattern could grow indefinitely — that all configurations would eventually stabilize or die out. He offered $50 to whoever could prove or disprove this. Just one month later, in November 1970, a team at MIT led by Bill Gosper found the answer: he was wrong.

The Gosper Glider Gun is a 36-cell pattern that perpetually generates a new Glider every 30 generations. It fires gliders like a machine gun into empty space, growing the total live-cell count without bound. Gosper's team claimed the $50 prize and overturned Conway's conjecture in one shot.

The Glider Gun was the key that unlocked computation in Life. Once you can produce unlimited gliders, you can use their collisions as computational primitives. Two streams of gliders arriving at the right time and angle can annihilate each other — or produce new patterns. A glider arriving at a certain position is a binary "1"; its absence is a "0." Two streams of gliders arranged correctly can perform AND, OR, and NOT operations. Stack enough of those together and you have a working computer.

The Universe Inside the Universe

The recursive depths of Life are almost vertiginous. Not only is Life Turing complete, but it's possible to build a working simulation of Life inside Life.

The OTCA Metapixel, created by Brice Due between 2005 and 2006, is a pattern 2,048 × 2,048 cells in size that behaves as a single Life cell when viewed at sufficient zoom — it is "on" or "off," it counts its Moore neighbors, and it follows the standard Life rules. Tile the infinite plane with these metapixels, and you have Life simulating Life. Each metapixel takes 35,328 generations to complete one tick of the simulated Life, but the logic holds perfectly. You can build Life inside Life inside Life — turtles all the way down — and each layer is a legitimate execution of the same four rules.

This is not just a curiosity. It's a concrete demonstration of what Turing completeness means in practice: a system powerful enough to simulate itself is powerful enough to simulate anything.

Conway's Complicated Legacy

John Horton Conway was one of the most creative and unconventional mathematicians of the 20th century. He discovered surreal numbers — a breathtaking extension of the number system that encompasses all real numbers, plus infinite quantities and infinitesimals smaller than any positive real, arising naturally from a theory of combinatorial games. He considered surreal numbers his greatest mathematical achievement. He made fundamental contributions to the theory of symmetry groups, including work on the Monster Group — the largest of the 26 sporadic simple groups, a mathematical object of staggering complexity and beauty.

And yet, he was known above all for a game he invented in an afternoon.

His feelings about this were complicated. "It's nice in one way," Conway said. "It really means that I might be one of the best-known mathematicians in the present day... But it's embarrassing." He had invented surreal numbers, mapped the Monster Group, contributed to deep results across multiple fields — and he was famous for a grid of cells.

There's a lesson in this about the relationship between simplicity and fame. The most accessible thing Conway created — four rules, any grid, anyone can play — became his defining legacy in a way that his deeper and harder work never could. This is not unique to Conway. The Pythagorean theorem overshadows everything else Pythagoras did. Bayes' theorem is better known than the man himself. Sometimes the most powerful things are the simplest to describe.

Conway died in April 2020, one of the first prominent scientists lost to COVID-19. He was 82. The online Life community honored him with elaborate pattern constructions built within the game that bore his name.

Why Four Rules? Why Not Three or Five?

It's worth pausing on how carefully the rules are balanced. Conway didn't pick them randomly — he wanted a specific kind of behavior: patterns that were neither too stable (where everything freezes immediately) nor too chaotic (where everything dissolves immediately). The birth rule of exactly 3 neighbors is precise. The survival rule of 2 or 3 is precise. Change any single number and the universe becomes either a static desert or a boiling soup.

This sensitivity is itself a mathematical observation: interesting behavior in rule-based systems tends to cluster near a kind of phase transition between order and chaos. Life sits right at that edge — and that's why it generates structures worth studying.

Takeaways

• Four rules are enough to build a universe. Conway's Game of Life generates unbounded complexity — including working computers — from just four constraints applied to a grid of binary cells.

• Emergence is real and verifiable. Life demonstrates mathematically that complex, life-like, computation-capable behavior can arise from simple local rules with no global plan. This has deep implications for biology, physics, and the study of consciousness.

• Turing completeness is everywhere. The Game of Life can simulate any algorithm any computer can run, making it not just a toy but a model that connects recreational math directly to the foundations of computer science.

• Gliders are the building blocks. The humble five-cell Glider — period 4, diagonal motion, 3×3 bounding box — became the fundamental unit of computation in Life: a bit, a signal, a bullet, all in one.

• Simple descriptions don't measure depth. Conway's most famous creation was also his most accessible — but accessibility is not the same as significance. The deeper mathematical work often lives in the shadow of the vivid example.

Resources: - LifeWiki — the canonical encyclopedia of Life patterns and theory - Golly — open-source cellular automaton simulator; can run the Gosper Gun, Turing Machines, and metapixel constructions - Quanta Magazine: A Life in Games — an excellent profile of John Conway's full mathematical career