Patterns from All Possible Elementary Cellular Automata

first included rule

rule sequence length

step

initial condition

include non-quiescent rules

Different cellular automaton rules typically produce different patterns. But this Demonstration shows what happens if one averages patterns from a sequence of possible rules. Notice how the rule 90 pattern seems to visually stand out, even when all the rules are averaged.

External Links

Cellular Automaton (Wolfram MathWorld)

Elementary Cellular Automaton (Wolfram MathWorld)

Rule 30 (Wolfram MathWorld)

Rule 50 (Wolfram MathWorld)

Rule 54 (Wolfram MathWorld)

Rule 60 (Wolfram MathWorld)

Rule 62 (Wolfram MathWorld)

Rule 90 (Wolfram MathWorld)

Rule 94 (Wolfram MathWorld)

Rule 102 (Wolfram MathWorld)

Rule 110 (Wolfram MathWorld)

Rule 126 (Wolfram MathWorld)

Rule 150 (Wolfram MathWorld)

Rule 158 (Wolfram MathWorld)

Rule 182 (Wolfram MathWorld)

Rule 188 (Wolfram MathWorld)

Rule 190 (Wolfram MathWorld)

Rule 220 (Wolfram MathWorld)

Rule 222 (Wolfram MathWorld)

Permanent Citation

Stephen Wolfram

"Patterns from All Possible Elementary Cellular Automata"
http://demonstrations.wolfram.com/PatternsFromAllPossibleElementaryCellularAutomata/
Wolfram Demonstrations Project
Published: May 2, 2008