Conway's Game of Life: Complexity from Simplicity

simulator beginner ~8 min
Loading simulation...
~750 alive cells — evolving

Starting from 30% density on a 50×50 grid, the population rapidly evolves through a chaotic phase before settling into a stable ecosystem of still lifes and oscillators.

Formula

Next state: alive if (alive AND neighbors ∈ {2,3}) OR (dead AND neighbors = 3)
Glider period: 4 generations, displacement: (1,1) diagonal

Four Rules That Create a Universe

Conway's Game of Life, devised by mathematician John Conway in 1970, is a zero-player game — its evolution is determined entirely by its initial state. The rules are breathtakingly simple: each cell on an infinite grid is either alive or dead, and its next state depends solely on how many of its eight neighbors are alive. Yet from these four rules emerges a staggering variety of behaviors: stable structures, oscillators, gliders that fly across the board, and self-replicating patterns.

Emergent Complexity

The Game of Life is the quintessential example of emergence — complex behavior arising from simple rules without any central control. No single cell 'knows' about gliders or oscillators; these patterns emerge from local interactions. This principle underlies much of modern complexity science, from flocking birds to neural networks to economic markets. Simple rules, complex behavior.

Classic Patterns

Select different starting patterns to explore the zoo of Life structures. The glider is the smallest pattern that travels across the grid. The R-pentomino, just 5 cells, evolves for 1,103 generations before stabilizing. The Gosper glider gun, discovered in 1970, produces a new glider every 30 generations — the first pattern proven to grow without bound. The pulsar is a beautiful period-3 oscillator.

Computation and Life

Perhaps the most remarkable discovery about the Game of Life is that it's Turing-complete — it can simulate any computation that any computer can perform. Logic gates, memory, and even entire computers have been built from Life patterns. This means that simple rules of birth and death, applied to a grid of cells, contain the full power of universal computation. Conway's toy model hints at how physical laws might give rise to the complexity of the real world.

FAQ

What are the rules of Conway's Game of Life?

Each cell is alive or dead. Every generation: (1) A live cell with 2 or 3 live neighbors survives. (2) A live cell with fewer than 2 neighbors dies (underpopulation). (3) A live cell with more than 3 neighbors dies (overpopulation). (4) A dead cell with exactly 3 live neighbors becomes alive (reproduction).

Is the Game of Life Turing-complete?

Yes. The Game of Life can simulate any Turing machine, meaning it can compute anything that's computable. This was proven by constructing logic gates, memory, and a universal constructor from Life patterns. In principle, you could build a computer inside the Game of Life.

What is a glider in the Game of Life?

A glider is the smallest spaceship — a pattern that moves diagonally across the grid, cycling through 4 phases every 4 generations. It was one of the first patterns discovered and is often used as the symbol of the hacker community. The Gosper glider gun produces a stream of gliders.

Why is the Game of Life important?

The Game of Life demonstrates that extreme complexity can emerge from extremely simple rules — a key insight for understanding biological evolution, self-organization, and emergent behavior. It's also foundational to the study of cellular automata, artificial life, and computational universality.

Sources

Embed

<iframe src="https://homo-deus.com/lab/computer-science/game-of-life/embed" width="100%" height="400" frameborder="0"></iframe>
View source on GitHub