A cellular automaton is just a lookup table: every cell looks at its neighborhood and the table says what it becomes next tick. The rule string is that table, compressed. Tap any example to run it.
3000011110 as binary, which is the number 30 —
hence "rule 30".r2:2863311530r2:0xAAAA5555). 4.3 billion rulebooks.k3:9121020210₃.
The sum the cell sees → the state it becomes. Extra states
mean extra colors for free.B3/S23B3678 means "born on 3, 6, 7 or 8
live neighbors."
This dead cell touches 3 live cells — under B3
it's born next tick.
A dead cell is Born if its count is in the B set; a live cell
Survives if its count is in the S set; everything else dies. An empty set
is legal: Seeds is B2/S — born on 2, survives never.
B3/S23 is Conway's Life; legacy survival-first 23/3
also parses.B2/S/3B2/S/3 is Brian's Brain: born on
2, survives never, 3 states (alive, ghost, dead). B2/S345/4 is
Star Wars: born on 2 · survives on 3, 4 or 5 · two ghost steps. Legacy
/2/3 also parses.Grids wrap at the edges (a torus), so gliders that leave come back. The 🎲 button rolls random rules from all these families and quietly re-rolls the duds.