Home▸Articles▸Algorithms & AI

2D CA Rule-Space Classifier: Langton's λ on a Moore Lattice

An exploration of cellular automata in two dimensions, revealing how simple rules can lead to complex behaviors.

mysimulator teamUpdated June 2026≈ 3 min read▶ Open the simulation

What is a Cellular Automaton?

A cellular automaton (CA) is a discrete model studied in computability theory, mathematics, and computer science. It consists of a grid of cells that evolve over time according to a set of rules based on the states of neighboring cells.

In this context, each cell can be in one of several possible states, and its state at the next time step is determined by applying a specific rule based on the current states of itself and its neighbors.

Understanding Langton's λ

Langton's λ parameter is used to classify two-dimensional outer-totalistic cellular automata. It represents the average number of neighbors in which a cell can change state, providing insight into the complexity and behavior of the CA.

By sweeping through different values of λ, one can observe how the rulespace transitions from order to chaos, revealing patterns such as periodicity, edge-of-chaos complexity, and full chaos.

live demo · related simulation● LIVE

Moore Lattice and Toroidal Boundary Conditions

A Moore lattice is a type of cellular automaton grid where each cell has eight neighbors: the four orthogonally adjacent cells and the four diagonally adjacent cells.

Toroidal boundary conditions mean that the edges of the lattice are connected, forming a doughnut-like shape. This ensures that patterns can wrap around the edges without being lost.

Applications and Implications

The study of cellular automata has applications in various fields including computer science, biology, physics, and even urban planning.

By understanding how different rules lead to diverse behaviors, researchers can model complex systems and predict emergent phenomena.

Frequently asked questions

What is the significance of Langton's λ parameter?

Langton's λ parameter helps in classifying two-dimensional outer-totalistic cellular automata by averaging the number of neighbors that can influence a cell's state, providing insights into the system's behavior and complexity.

Why use a Moore lattice instead of a simpler grid?

A Moore lattice with eight neighbors per cell allows for more complex interactions between cells, leading to richer and more varied patterns in cellular automata simulations.

What does the edge-of-chaos complexity mean in CA rule spaces?

The edge-of-chaos complexity refers to a region in the rule space where cellular automata exhibit highly complex, yet not chaotic behavior. This is often associated with self-organized criticality and can lead to emergent patterns that are both ordered and unpredictable.

How does changing λ affect the CA's evolution?

Changing Langton's λ parameter shifts the rule space, leading to different behaviors in the cellular automata. As λ varies, one may observe transitions from simple periodic behavior through complex edge-of-chaos patterns to full chaos.

Try it live

Everything above runs in your browser — open 2D CA Rule-Space Classifier: Langton's λ on a Moore Lattice and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.

▶ Open 2D CA Rule-Space Classifier: Langton's λ on a Moore Lattice simulation

What did you find?

Add reproduction steps (optional)