Conway’s Game of Life
Conway’s Game of Life is the most famous cellular automaton: an infinite grid of cells that live or die by three rules based only on their eight neighbours. Paint a starting pattern by clicking and dragging on the wrap-around (toroidal) grid, or load a preset — a glider, the Gosper glider gun, a pulsar, the R-pentomino or a lightweight spaceship — then play, pause, single-step and change speed. A density slider seeds random soups, generation and population counters track the run, and you can export the current grid as a PNG.
Runs 100% in your browser — simulations are computed locally on your device.
Read the full guide to this tool
Notes
- Rules: a live cell with 2 or 3 live neighbours survives; a dead cell with exactly 3 live neighbours is born; everything else dies or stays empty.
- The grid wraps around at the edges (a torus), so gliders that leave one side reappear on the other.
- From almost any random start the soup settles into still lifes, blinkers and the occasional escaping glider — complex behaviour from three trivial rules.
- Runs 100% in your browser — simulations are computed locally on your device.