Cellular automata
From GenerativeArt
(Difference between revisions)
(spacing) |
(add 1 D applet) |
||
The basic Wolfram cellular automaton uses only K = 2 states and R = 1 neighbor to either side. | The basic Wolfram cellular automaton uses only K = 2 states and R = 1 neighbor to either side. | ||
| - | == | + | ==Example of a Basic Cellular Automaton Rule and Rule Number== |
| + | |||
'''Number of rules = number of possible states''' | '''Number of rules = number of possible states''' | ||
{{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1.gif|caption=}}<br /> | {{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1.gif|caption=}}<br /> | ||
| - | + | The eight result bits are then used to name the rule set with a rule number | |
| - | + | ||
| - | + | C<sub>i</sub>(T+1) = 00110101 = 53 | |
| - | + | ||
| + | thus it is named "rule number 53" | ||
| + | |||
| + | [[http://philipgalanter.com/howdy/applets/1dca/index.html Click here to run a one dimensional cellular automata applet.]] | ||
==Wolfram's Classification== | ==Wolfram's Classification== | ||
