Cellular Automata Examplesllms.txt
Cellular automata update grids of cells using fixed, local rules. Each tick applies the rule across the grid so patterns emerge from the interactions of neighboring cells.
They range from simple chaos like Rule 30 to fully general computation. Rule 110 in particular was proved Turing complete: despite its tiny rule table it can emulate any algorithm, showing how small rules can create a universe of behavior.
Select an example to explore it in the playground.
Beginner - Introductory Models
Elementary Cellular Automata
One 8-bit rule number, three worlds: flip it to walk a single-line automaton from an ordered fractal through Turing-complete complexity to deterministic chaos.
Level: Beginner
Game of Life
Conway's Game of Life: a random soup self-organizes into still-lifes, blinkers, and gliders — global order from one local rule.
Level: Beginner