Conway's Game of Life — Four Rules, Infinite Behavior

Post 2 covered 1D elementary CAs; this post covers the famous 2D one. The Game of Life (devised by mathematician John Conway) is the single best-known cellular automaton, a perfect, vivid demonstration of the series’ theme — astonishing complexity from a handful of simple rules — and the gateway through which most people first meet emergence.

The rules

The Game of Life is a 2D cellular automaton: an infinite grid of square cells, each alive or dead, where each cell’s neighborhood is its eight surrounding cells (the Moore neighborhood). Every step, all cells update simultaneously by just four rules, based only on how many of a cell’s eight neighbors are alive:

• Underpopulation — a live cell with fewer than two live neighbors dies (as if from loneliness).
• Survival — a live cell with two or three live neighbors stays alive.
• Overpopulation — a live cell with more than three live neighbors dies (as if from overcrowding).
• Reproduction — a dead cell with exactly three live neighbors becomes alive (as if by reproduction).

That’s the entire game: four rules about neighbor counts, applied to every cell at once, step after step. There are no players — you set an initial pattern of live cells and watch it evolve. The “game” is zero-player: the only input is the starting configuration, and the rules do the rest. It’s a beautifully clean instance of post 1’s CA machinery — a 2D grid, two states, the 8-cell neighborhood, one simple rule — and from these four trivial rules comes everything below.

The menagerie: what emerges

What makes the Game of Life legendary is the extraordinary variety of structures that emerge from those four rules — a whole taxonomy of “life forms,” none designed in, all emergent:

• Still lifes — stable patterns that never change (a 2×2 block, a “beehive”). They sit forever, in equilibrium with the rules.
• Oscillators — patterns that cycle through a repeating sequence of states (the “blinker” flipping between two forms, the “pulsar”). They pulse periodically, like a heartbeat.
• Spaceships — especially the glider. The famous glider is a small pattern that moves across the grid, step by step, translating itself diagonally forever. This is remarkable: a moving structure emerging from static rules — the cells themselves don’t move, but the pattern propagates, like a wave. The glider became the emblem of the Game of Life (and of the hacker ethos) precisely because it so vividly shows emergent, self-propagating structure from simple rules. Larger spaceships exist too.
• Guns — patterns that emit a stream of other patterns. The Gosper glider gun periodically fires out gliders, forever — an emergent structure that produces other emergent structures. Guns were pivotal because they showed the Life “universe” could generate unbounded activity (and, with gliders as signals, compute — post 5).
• Methuselahs — tiny starting patterns that evolve for a very long, chaotic time before settling, producing enormous complexity from a few initial cells. They show how unpredictable and rich the evolution from a trivial seed can be.

This menagerie — still lifes, oscillators, gliders, guns, and more — is a zoo of emergent behavior, none of it programmed in. Nobody wrote a “glider rule”; the glider emerges from the four neighbor-counting rules. The sheer variety and lifelikeness of these patterns (hence “Life”) is why the Game of Life is the canonical, visceral demonstration of emergence: you watch complex, organized, lifelike structures arise, move, interact, and reproduce — all from four rules about counting neighbors.

Why the Game of Life matters

Beyond its fame and fascination, the Game of Life carries real significance:

• The clearest demonstration of emergence. More than any other single object, the Game of Life makes the series’ core idea visceral: you see complexity, motion, structure, and lifelike behavior emerge from four trivial rules, in real time. It’s the canonical teaching example of emergence for exactly this reason — undeniable and beautiful.
• It’s Turing complete (post 5). Astonishingly, the Game of Life is a universal computer — using gliders as signals, glider guns as sources, and pattern collisions as logic gates, you can build any computation inside the Life grid (logic gates, memory, even a working computer have been constructed in Life). Four neighbor-counting rules yield a system that can compute anything — a profound statement about how little is needed for universal computation (the deep link to post 5).
• It shaped how people think about complexity and life. The Game of Life influenced thinking about self-organization, artificial life, emergence, and whether “life” and complexity require special ingredients or can arise from simple rules — questions at the heart of complexity science. It made “simple rules, lifelike complexity” a widely-understood idea.
• It’s culturally foundational. The Game of Life is one of the most beloved objects in computer science and math — the glider is practically a symbol of the field — and a rite of passage for programmers who implement it and watch emergence unfold. Its cultural weight reflects how powerfully it conveys a deep idea.

The through-line: Conway’s Game of Life is a 2D cellular automaton — an infinite grid of alive/dead cells with the 8-neighbor neighborhood — governed by just four rules about neighbor counts (underpopulation <2 dies, survival 2–3 lives, overpopulation >3 dies, reproduction exactly-3 is born), played by watching a starting pattern evolve (zero-player). From those four trivial rules emerges an astonishing menagerie: still lifes (stable), oscillators (pulsing), spaceships (the glider, a pattern that moves), guns (the Gosper gun firing gliders forever), and methuselahs (tiny seeds → vast complexity) — a zoo of lifelike, self-propagating, self-producing structures, none designed in. It matters as the clearest, most visceral demonstration of emergence, as a proof that four rules yield a Turing-complete universal computer (post 5), as a shaper of thinking about complexity and artificial life, and as a culturally foundational object of computer science — the canonical emblem of complexity from simplicity.

Key takeaways

• Conway’s Game of Life is a 2D cellular automaton: an infinite grid of alive/dead cells, each with the 8-cell (Moore) neighborhood, all updating simultaneously by four rules on neighbor counts — underpopulation (live cell, <2 neighbors → dies), survival (live, 2–3 → lives), overpopulation (live, >3 → dies), reproduction (dead, exactly 3 → born).
• It’s zero-player: you set an initial pattern and watch it evolve — the clean 2D instance of CA machinery (grid, two states, neighborhood, one rule).
• From four trivial rules emerges a menagerie of structures, none designed in: still lifes (stable — block, beehive), oscillators (cycling — blinker, pulsar), spaceships especially the glider (a pattern that moves across the grid — the cells don’t move, the pattern propagates; the emblem of Life), guns (the Gosper glider gun firing gliders forever — structures producing structures), and methuselahs (tiny seeds → long chaotic evolution → vast complexity).
• The menagerie is a zoo of emergent behavior — nobody wrote a “glider rule”; gliders, guns, and oscillators emerge from neighbor-counting — making Life the canonical, visceral demonstration of emergence (you watch lifelike complexity arise, move, interact, reproduce from four rules).
• It matters deeply: the clearest demonstration of emergence, a proof that four rules yield a Turing-complete universal computer (gliders as signals, guns as sources, collisions as gates — post 5; a profound statement about how little universal computation needs), a shaper of complexity/artificial-life thinking, and a culturally foundational object of computer science (the glider as a field symbol) — the emblem of complexity from simplicity.

Further reading

• Conway’s Game of Life — the famous four-rule 2D cellular automaton
• Cellular automaton — the general framework Life instantiates