Explore all 256 rules of 1D elementary cellular automata
Rule 110
Famous rules:
Elementary cellular automata (Wolfram 1983): each cell is 0 or 1; next state determined by cell + two neighbors (8 patterns → rule number 0–255). Rule 110 is Turing-complete.