1D Cellular Automata

Grid Size: Variable (100-800 cells wide), evolving over multiple generations
Rule System: Wolfram's elementary cellular automata (256 possible rules)
Initial Condition: Single active cell in the center of the first row
Neighborhood: Each cell considers itself and its two immediate neighbors
Implementation: Uses Web Workers for non-blocking computation
Visualization: Black cells represent active states, white cells represent inactive states

Explore the fascinating world of 1D cellular automata, where simple local rules generate complex emergent patterns over time. Each row represents a generation, with cells evolving based on their neighbors according to the selected rule. From chaotic randomness to structured fractals, witness how complexity can arise from simplicity.

How to use: Enter a rule number (0-255) in the input field and click "Set Rule" or press Enter. Each rule number corresponds to a different set of local transition rules.

Try these interesting rules:

Rule 30: Chaotic randomness (Class 3)
Rule 90: Sierpinski triangle / Pascal's triangle mod 2
Rule 110: Complex computation (Turing complete, Class 4)
Rule 54: Universal computation candidate (Class 4)
Rule 60: Sierpinski triangle patterns
Rule 18: Beautiful nested triangular patterns
Rule 126: Dense carpet-like patterns
Rule 150: Clean geometric XOR triangles
Rule 184: Traffic flow model

Rule Number (0-255): Detail Level: