Cellular Automaton Simulators
Explore cellular automaton simulations: Conway's Game of Life and all 256 Elementary Cellular Automaton rules. Runs in your browser.
What Are Cellular Automata?
Overview
Cellular automata (CA) are discrete computational models consisting of a grid of cells, each in one of a finite number of states. At each time step, every cell updates its state simultaneously based on a fixed rule that considers the states of its neighboring cells. Despite their simplicity, cellular automata can produce remarkably complex behaviors — from stable patterns to chaotic dynamics — making them a powerful tool for studying emergence and self-organization.
Types of Cellular Automata
Cellular automata come in many forms depending on their dimensionality, neighborhood definition, and rule structure.
| Type | Dimensions |
|---|---|
| Elementary CA | 1D |
| Totalistic CA | 1D / 2D |
| Life-like CA | 2D |
| Continuous CA | 2D+ |
Brief History
Cellular automata were first studied by Stanislaw Ulam and John von Neumann in the 1940s at Los Alamos National Laboratory. Von Neumann was interested in self-replicating systems and designed a 2D CA capable of universal computation. In 1970, John Conway created the Game of Life, which became widely popular and demonstrated how complex behavior emerges from simple rules. In the 1980s, Stephen Wolfram systematically studied elementary cellular automata, classifying their behavior into four classes and proposing that simple programs can generate complexity comparable to natural phenomena.
Applications
- Modeling physical phenomena (crystal growth, fluid dynamics, diffusion)
- Biological simulations (population dynamics, pattern formation)
- Cryptography and random number generation (Rule 30)
- Traffic flow simulation and urban planning
- Theoretical computer science (computation universality, complexity theory)
Glossary
- Cellular Automaton
- A cellular automaton (plural: cellular automata, abbrev. CA) is a discrete model of computation consisting of a grid of cells, each in one of a finite number of states. Cells update simultaneously based on the states of their neighbors according to a fixed rule. CAs are studied in automata theory, complexity science, and mathematical biology.
- Conway's Game of Life
- The Game of Life is a 2D cellular automaton created by mathematician John Horton Conway in 1970. It uses simple birth/survival rules (B3/S23): a dead cell with exactly 3 neighbors becomes alive, and a living cell with 2 or 3 neighbors survives. It is Turing complete and has been extensively studied for its emergent complexity.
- Elementary Cellular Automaton
- An elementary cellular automaton (ECA) is a 1D CA where each cell has two possible states and the next state depends on the cell and its two immediate neighbors. There are 256 possible rules (numbered 0–255). Some rules produce simple patterns, while others like Rule 30 and Rule 110 generate complex, chaotic, or universal behavior.
- Wolfram Classification
- Stephen Wolfram classified elementary cellular automata into four behavioral classes: Class 1 (uniform), Class 2 (periodic), Class 3 (chaotic/random), and Class 4 (complex/edge of chaos). Rule 110, a Class 4 automaton, was proven Turing complete by Matthew Cook in 2004.
FAQ
- Q: Are cellular automata Turing complete?
- A: Some are. Rule 110 in elementary cellular automata and Conway's Game of Life have been proven to be Turing complete, meaning they can simulate any computation that a Turing machine can perform.
- Q: What is the difference between Game of Life and Elementary CA?
- A: Game of Life operates on a 2D grid where each cell has 8 neighbors (Moore neighborhood) and uses birth/survival rules. Elementary CA operates on a 1D row where each cell has 2 neighbors, with 256 possible rule sets. Both are deterministic zero-player systems.
- Q: Who invented cellular automata?
- A: The concept was developed by Stanislaw Ulam and John von Neumann in the 1940s. Von Neumann designed a self-replicating CA as a theoretical model for biological reproduction. The field gained popular attention with Conway's Game of Life (1970) and Wolfram's systematic studies (1980s).
- Q: Can I use these simulators on mobile?
- A: Yes. Both the Game of Life and Elementary CA simulators run entirely in your browser and are responsive. Performance depends on your device, but modern smartphones handle them well.