Premium experiment • local rules → emergence

COMPUTER SCIENCE & TECHNOLOGY • ALGORITHMS

Elementary Cellular Automata

Apply one local binary rule repeatedly and watch simple neighborhood updates create large-scale structure across time.

● INTERACTIVEElementary Cellular Automata
Rule
Grid
Live density
Live cells

Reasoning inspector

live model state
Rule encoding—
Seed—
Grid—
Overall live density—
Final-row density—
Final live cells—
Final transitions—
Mirror agreement—

Explore emergence from local rules

Keep the initial seed fixed while changing the rule to compare symmetry, repetition, density, and complex deterministic patterns.

LEARN WITH THE SIMULATION

Understand Elementary Cellular Automata by experimenting.

START HERE

An elementary cellular automaton converts an eight-bit local lookup table into a large deterministic spacetime pattern. Every new cell reads only three cells from the previous row—left, center and right—yet repeated application can produce symmetry, fractal structure, moving features or visually irregular behavior. The premium inspector exposes rule bits, live-cell density, final-row transitions and mirror agreement so emergence can be analyzed quantitatively rather than judged only by appearance.

BUILD THE IDEA

What you should understand first

  • Decode a rule number into the eight neighborhood outputs from 111 through 000.
  • Explain how synchronous local updates generate a full spacetime history.
  • Compare global density and final-row structure across deterministic rules and seeds.
  • Distinguish deterministic complexity from randomness by holding the rule fixed and changing only the initial seed.

TRY IT YOURSELF

How can two deterministic runs under the same local rule develop very different visible histories?

  1. Select Rule 30 with a single-cell seed and record final-row density and transitions.
  2. Keep Rule 30 but switch to pair and stripe seeds.
  3. Compare the resulting histories and final-row metrics.
  4. Switch to Rule 90 or Rule 110 and explain which differences come from the rule table versus the seed.
Read the visual:

The rule uniquely determines how each local neighborhood updates, but the initial condition determines which neighborhoods actually occur. A deterministic rule can therefore amplify small structural differences in the seed into very different global patterns.

WHY IT WORKS 01

The decimal rule number is literally an eight-bit lookup table

Each three-cell neighborhood is a binary number from 111₂ = 7 down to 000₂ = 0. The corresponding bit of the rule number decides the next center-cell value. Rule 30, for example, is 00011110₂ when written across the eight outputs. Once those eight bits and the starting row are fixed, every later row is determined.

WHY IT WORKS 02

Local information can create long-range visual structure

No cell knows the global pattern, yet neighboring outputs become the inputs to later neighborhoods. Information therefore propagates through repeated overlap of local neighborhoods. Symmetric rules can preserve mirror structure from symmetric seeds, while asymmetric rules or asymmetric seeds can produce directional or irregular-looking structures.

WHY IT WORKS 03

Density alone does not describe the pattern

Two rows can contain the same fraction of live cells but arrange them very differently. That is why the inspector also reports adjacent transitions and mirror agreement. Transitions provide a simple measure of local alternation, while mirror agreement provides a crude symmetry indicator; neither is a complete complexity measure, but together they show why one scalar density is insufficient.

DO NOT MIX THESE UP

Common misconception

The rule number is not a randomness parameter; it is an eight-bit encoding of deterministic outputs. A cell also does not inspect the whole grid or future rows. The apparent complexity emerges from repeated local updates and from the structure of the initial condition.

PRACTICE CHALLENGE

Can you hit a target final-row density and still explain why another pattern with similar density may look completely different?

  • Choose a target final live-cell density.
  • Change rule or seed until the final row reaches the target tolerance.
  • Compare final transitions and mirror agreement with another run having similar density.
  • Use the eight-bit rule encoding to explain why the two histories differ even when their final densities are close.
Reveal the reasoning

Final density measures only how many cells are live, not where they occur. Two deterministic automata can therefore share similar density while differing strongly in adjacency, symmetry and ancestry. The actual evolution is determined by the rule lookup table together with the seed, not by density alone.

MODEL BOUNDARIES

What this simulation assumes

Every simulation simplifies reality or a mathematical system. These are the assumptions and limits to keep in mind while interpreting the results.

Model assumptions

  • Cells are binary and update synchronously from their left, center, and right neighbors.
  • The same elementary rule is applied to every cell on every generated row.
  • Cells beyond the displayed left and right boundaries are treated as permanently zero.

Model limitations

  • Different boundary conditions or asynchronous updates can produce different patterns from the same rule.
  • The visualization covers one-dimensional elementary cellular automata and does not represent higher-dimensional or probabilistic rule systems.

CONNECT IT

Where this matters

  • Complex-systems modeling
  • Procedural pattern generation
  • Foundations of computation and emergence
  • Traffic and lattice-style discrete models

WORDS THAT MATTER

Key vocabulary

Cellular automaton
Discrete grid system whose cells update synchronously from a local rule.
Neighborhood
The left-center-right three-cell pattern used to determine one next-state value.
Rule number
Decimal encoding of the eight binary outputs for neighborhoods 111 through 000.
Seed
Initial row from which the deterministic evolution begins.
Density
Fraction of cells in the live state over a row or grid region.