🔲 Cellular Automaton
A cellular automaton is a grid of cells, each in one of a finite number of states, that evolves in discrete time steps according to a fixed rule based on the states of neighbouring cells. Despite their simplicity, cellular automata can generate remarkably complex, unpredictable and even Turing-complete behaviour from purely local interactions.
🧪 See it in action
🔲 Langton's Ant — Cellular Automaton that Builds Highways📖 Go deeper
For a fuller technical treatment, see the Algorithms Glossary — C (Cellular Automata) reference on MySimulator.
Browse more terms in the MySimulator Glossary, or explore the full library of 1000+ interactive, browser-based simulations.