One of the most popular examples of cellular automata is probably
Conways Game of Life. In Conways Game of
Life automaton, a cell can be born if there are exactly 3 neighbouring cells alive. An alive cell can die and
from overpopulation if there are more than 3 alive, neighbouring cells or starve from underpopulation if there
are less than 2. The rules for automata can be written in the MCell notation as B3/S23 (birth 3, survival 2 or
3). There are many more interesting
cellular automata with rules like B4678/S35678, B36/S23 and even the simple B2/S.
Type your favorite ruleset into the textbox and watch the cells evolve! The demo uses a Ping Pong WebGL Shader model for performant parallel computation.
Due to WebGL issues, the simulation does not work on your device