### Automaton Explorer

rule: 30 start: point random

From MathWorld: "A cellular automaton is a collection of 'colored' cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells." This example explores binary, nearest-neighbor, one-dimensional automata, of which there are 256 (28) possible rules. The eight possible outcomes for the current rule are shown across the top; click to toggle the selected bit.