Skip to content
Category

Cellular automaton rules

page 1
Conway's Game of Life
two-dimensional cellular automaton devised by J. H. Conway in 1970
Langton's ant
two-dimensional Turing machine with emergent behavior
Wireworld
thumb|183px|2 Wireworld diodes, the above one in conduction direction, the lower one in reverse-biasing Wireworld, alternatively WireWorld, is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of Scientific American. Wireworld is particularly suited to simulating transistors, and is Turing-complete.
Rule 30
one-dimensional cellular automaton rule with chaotic behavior
Turmite
A 2-state 2-color turmite on a square grid. Starting from an empty grid, after 8342 steps the turmite (a red pixel) has exhibited both chaotic and regular movement phases.|thumb|250x250px
Rule 184
elementary cellular automaton
Paterson's worms
family of cellular automata
Wa-Tor
Wa-Tor is a population dynamics simulation devised by A. K. Dewdney and presented in the December 1984 issue of Scientific American in a five-page article entitled "Computer Recreations: Sharks and fish wage an ecological war on the toroidal planet Wa-Tor".
Abelian sandpile model
cellular automaton
Rule 90
elementary cellular automaton based on the exclusive-or function
Langton's loops
self-reproducing patterns in a particular cellular automaton rule, investigated in 1984 by Christopher Langton
Biham–Middleton–Levine traffic model
cellular automaton traffic flow model
Lenia
thumb|A sample autonomous pattern from Lenia. thumb|An animation showing the movement of a glider in Lenia. Lenia is a family of cellular automata created by Bert Wang-Chak Chan. It is intended to be a continuous generalization of Conway's Game of Life, with continuous states, space and time. As a consequence of its continuous, high-resolution domain, the complex autonomous patterns ("lifeforms" or "spaceships") generated in Lenia are described as differing from those appearing in other cellular automata, being "geometric, metameric, fuzzy, resilient, adaptive, and rule-generic".
Nagel-Schreckenberg model
traffic simulation model
von Neumann cellular automaton
cellular automaton used to model universal construction
Rule 110
elementary cellular automaton with behavior on the boundary between stability and chaos