Conway's cellular automaton: a grid of cells, each alive or dead, evolving by
four local rules — out of which gliders, oscillators, and deterministic chaos
emerge. Cells are coloured by how crowded their neighbourhood is, from cool
(lonely) to warm (crowded).
Rules
A live cell with fewer than two live neighbours dies (underpopulation).
A live cell with two or three live neighbours survives.
A live cell with more than three live neighbours dies (overpopulation).
A dead cell with exactly three live neighbours becomes alive (reproduction).
With noise on, the simulation occasionally seeds random cells so the
grid never settles into a still life.