A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells. The rules are then applied iteratively for as many time steps as desired.
[...]
The theory of cellular automata is immensely rich, with simple rules and structures being capable of producing a great variety of unexpected behaviors.
Try out the demo:
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrv0c5d9j3-2XSrFOhZ05Kv4xvqaObLrg65pBBUEcG67G3a-V_o_SBI3QdBX9q-kLSP7_TVaPXPV6sDEicZnTh73BEWf9VimYstgwYqyTmASTwn_D3w1-ZMhvKXxkCyjZ7HCCR/s400/snapshot-ClipsToNote-Header2.jpg)
Grant Robinson : Cellular Automata launcher
related:Cellular automaton - Wikipedia, the free encyclopedia
Cellular Automaton -- from Wolfram MathWorld
LinkNotes: John Conway's Game of Life