Cellular automata
From GenerativeArt
(Difference between revisions)
(→External Links) |
(→Example of a Basic Cellular Automaton Rule and Rule Number: tiny edit) |
||
==Example of a Basic Cellular Automaton Rule and Rule Number== | ==Example of a Basic Cellular Automaton Rule and Rule Number== | ||
| - | For each possible state combination of a cell and its neighbors, a state for the next time step must be specified. The entire set of transitions is a rule set, and the base | + | For each possible state combination of a cell and its neighbors, a state for the next time step must be specified. The entire set of transitions is a rule set, and the base K number (where K is the number of states a cell can have) can be used as a rule number. |
<blockquote> | <blockquote> | ||
[[http://mathworld.wolfram.com/ElementaryCellularAutomaton.html Click here to access a Wolfram Mathworld page illustrating all 256 rules.]] | [[http://mathworld.wolfram.com/ElementaryCellularAutomaton.html Click here to access a Wolfram Mathworld page illustrating all 256 rules.]] | ||
| - | |||
==Wolfram's Classification== | ==Wolfram's Classification== | ||
