Cellular automata #

Cellular automata are simple systems, defined by a grid of tiles with states (usually “dead” or “alive”, but could also be colors etc), and rules for how tiles transition states between iterations, usually based on their neighbours. One of the most famous and simple examples of a cellular automaton is Conway’s Game of Life. Despite their seeming simplicity, these systems exhibit breathtaking complexity and beauty.

  • A bunch of interesting examples of rules that lead to nice behaviour.
  • A beautiful attempt to classify (1-dimensional) cellular automata.