Cyclic Cellular Automaton - Rules

Rules

As with any cellular automaton, the cyclic cellular automaton consists of a regular grid of cells in one or more dimensions. The cells can take on any of states, ranging from to . The first generation starts out with random states in each of the cells. In each subsequent generation, if a cell has a neighboring cell whose value is the successor of the cell's value, the cell is "consumed" and takes on the succeeding value. (Note that 0 is the successor of ; see also modular arithmetic.) More general forms of this type of rule also include a threshold parameter, and only allow a cell to be consumed when the number of neighbors with the successor value exceeds this threshold.

Read more about this topic:  Cyclic Cellular Automaton

Famous quotes containing the word rules:

    Life is a game in which the rules are constantly changing; nothing spoils a game more than those who take it seriously. Adultery? Phooey! You should never subjugate yourself to another nor seek the subjugation of someone else to yourself. If you follow that Crispian principle you will be able to say “Phooey,” too, instead of reaching for your gun when you fancy yourself betrayed.
    Quentin Crisp (b. 1908)

    There are two great rules in life, the one general and the other particular. The first is that every one can in the end get what he wants if he only tries. This is the general rule. The particular rule is that every individual is more or less of an exception to the general rule.
    Samuel Butler (1835–1902)

    Let’s start with the three fundamental Rules of Robotics.... We have: one, a robot may not injure a human being, or, through inaction, allow a human being to come to harm. Two, a robot must obey the orders given it by human beings except where such orders would conflict with the First Law. And three, a robot must protect its own existence as long as such protection does not conflict with the First or Second Laws.
    Isaac Asimov (1920–1992)