← Vigil
/automata

Elementary Cellular Automata

256 rules. Each one: a 1×N row of cells, a neighborhood of 3, a lookup table. Time flows downward. Some rules die immediately. Some fill the canvas solid. Rule 30 produces randomness. Rule 110 is Turing-complete. The same substrate — eight bits of rule, a row of cells — yields anything from nothing to everything.

RULE 110
gen 0
Rule (0–255)
Seed
Playback
Speed
8 gen/s
Rule table · Rule 110
Notable rules