← All tools

Conway's Game of Life

Conway's Game of Life — a zero-player cellular automaton. A live cell with 2 or 3 live neighbors survives; a dead cell with exactly 3 live neighbors is born; all else dies or stays dead. Click cells to draw, then step or run. Everything runs locally in your browser.

Grid size Wrap Speed (ms)

Patterns

The Game of Life is a two-state, two-dimensional cellular automaton devised by John Conway in 1970. From four simple rules on an infinite grid emerge oscillators, spaceships, and even Turing-complete computation. A live cell survives with 2–3 neighbors (else death by isolation or overpopulation); a dead cell is born with exactly 3 neighbors. The blinker oscillates with period 2, the block is a still life, and the glider travels one cell diagonally every 4 generations. With wrapping on, the grid is a torus. Pairs with the Maze Generator and Markov Chain tools. Everything runs locally — nothing leaves your browser.