Cellular Automata (Rule 30 / Rule 110)

See how simple local rules create complex global structures in 1D cellular automata

Generation: 0 Alive Cells: 0 Density: 0%

Controls

Mathematical Rule

Local update for 1D cellular automata:

$$s_i^{t+1}=g\left(s_{i-1}^{t},\,s_i^{t},\,s_{i+1}^{t}\right)$$

The binary bits of the rule number determine outputs for the 8 neighborhood patterns.