Elementary Cellular Automaton

Rule Editor

Click on the bottom cells to toggle the output for each configuration:

Rule Number: 30

Binary: 00011110

About Elementary Cellular Automata

Elementary cellular automata are one-dimensional cellular automata with two possible states (0 or 1) per cell. Each cell evolves based on its current state and the states of its two immediate neighbors.

With 3 cells (left neighbor, self, right neighbor) and 2 possible states each, there are 2³ = 8 possible configurations. Each configuration can map to either 0 or 1, giving 2⁸ = 256 possible rules.

Notable Rules:

Rule 30: Produces chaotic, seemingly random patterns
Rule 90: Creates the Sierpinski triangle fractal pattern
Rule 110: Proven to be Turing complete (capable of universal computation)
Rule 184: Models traffic flow