Jump to content

Category:Cellular automata

From Rosetta Code

Tasks in this category show cell-based "machines" which have an initial set up and rules for each cell's transition between "steps". The cell fields can have any number of dimensions. There is a set of possible states for each cell and the rules for the cell transitions are usually based on the Moore neighborhood of each cell.

Reference

wp:Cellular automaton

Pages in category "Cellular automata"

The following 7 pages are in this category, out of 7 total.

Cookies help us deliver our services. By using our services, you agree to our use of cookies.