🟩 Game of Life
Value: 4 px
Value: 5
Value: 30%
🟩 Conway's Game of Life
Survives: 2 or 3 neighborsBorn: exactly 3 neighborsDies: <2 or >3 neighborsToroidal grid · click or drag to draw
Generation: 0

About Conway's Game of Life

Conway's Game of Life was invented by British mathematician John Horton Conway in 1970 and popularized through Martin Gardner's "Mathematical Games" column in Scientific American. Conway spent eighteen months searching for a set of rules simple enough to state in a few sentences yet rich enough to produce unlimited complexity. Starting from any finite configuration, the system can produce structures that move across the grid, oscillate indefinitely, grow without bound, or die out in a few generations. This emergent complexity from four minimal rules made the Game of Life one of the most studied examples of a two-dimensional cellular automaton.

The four rules govern every cell simultaneously based solely on the count of live neighbors among the eight adjacent cells (Moore neighborhood). A live cell with two or three neighbors survives; a live cell with fewer than two neighbors dies of underpopulation; a live cell with more than three neighbors dies of overcrowding; and a dead cell with exactly three live neighbors is born. Despite their simplicity, these rules produce an enormous variety of structures: stable "still lifes" such as the block and beehive, oscillating "blinkers" and "pulsars," and the traveling "gliders" and "spaceships." The Game of Life has been proven Turing-complete — configurations exist that can simulate any algorithm, including a fully operational Universal Turing Machine.

This visualization runs Game of Life on a toroidal grid: edges wrap around so that cells at the boundary interact with cells on the opposite side, eliminating edge effects and creating a closed finite universe. Adjust cell size, speed, and fill density using the sliders, or click and drag directly on the canvas to draw cells by hand. The pattern selector offers twelve presets spanning five categories. Spaceships — Glider and LWSS — travel across the grid indefinitely. The Gosper Glider Gun, discovered in 1970, was the first pattern proven to grow forever, firing a new glider every 30 generations. Oscillators cycle through states: the Blinker (period 2), Toad (period 2), Beacon (period 2), and Pulsar (period 3). Methuselahs are deceptively small seeds that take hundreds of generations to stabilize — the Acorn runs for over 5,000 generations, the R-pentomino for 1,103, and the Diehard disappears entirely after exactly 130. Block and Beehive are still lifes that never change.