Elementary Cellular Automata

Wolfram’s 256 elementary 1D cellular automata: the simplest possible rules that still produce staggering complexity. Each cell looks at itself and its two neighbors, consults an 8-bit rule table, and becomes alive or dead. From this comes fractals (Rule 90), pseudo-randomness (Rule 30), and universal computation (Rule 110). Select any rule, paint your own initial conditions, and watch the pattern cascade downward one generation at a time.