Science lab / cellular automata

Conway's Game of Life: worlds from four rules.

A grid of living and dead cells becomes a laboratory for emergence. Draw an initial pattern, start time, and watch local neighbour counts produce motion, order, and surprise.

Brief field note

A game with no players

British mathematician John Horton Conway devised the Game of Life around 1970 while investigating how simple local rules could create behaviour that was neither obviously repetitive nor merely random. Martin Gardner introduced it to a wide audience in the October 1970 issue of Scientific American, and it quickly became one of the best-known examples of a cellular automaton.

Life runs on a square grid. Every cell is either alive or dead, and every generation is calculated simultaneously from the eight surrounding cells. A dead cell is born when it has exactly three live neighbours. A live cell survives with two or three neighbours; otherwise it dies through isolation or overcrowding. The compact notation is B3/S23.

Those rules create recognisable families of structure. Still lifes remain unchanged. Oscillators return to earlier states. Spaceships such as the glider move across the grid. Larger arrangements can emit patterns, transmit signals, and perform logical operations. Life is capable of universal computation, meaning that suitable configurations can, in principle, reproduce the work of a general-purpose computer.

Its importance is the gap between rule and result. No cell sees the whole grid, stores a plan, or understands a pattern. Yet collective structure appears through repeated local interaction. Life therefore became an enduring model for emergence, complexity, artificial life, computation, and the limits of predicting a system from its rules alone.

About this version

This first deep guide uses the same standard B3/S23 simulator as the homepage. The grid has dead boundaries: cells beyond the visible edge are treated as dead. Draw or erase cells directly, adjust the rate and grid density, pause, advance one generation, or randomise the field. The population graph retains the complete history of the current world from generation zero onward. The grid reshapes to fit the available canvas while keeping every cell square, and automatically pauses after ten generations with no population change.

References

Deep instrument

Conway's original rules

Draw a starting world, then watch synchronous local decisions reshape it.

Generation 0

Population history

Generation 0 · 0 live cells

B3/S23: birth at three neighbours; survival at two or three.