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:

    Now for civil service reform. Legislation must be prepared and executive rules and maxims. We must limit and narrow the area of patronage. We must diminish the evils of office-seeking. We must stop interference of federal officers with elections. We must be relieved of congressional dictation as to appointments.
    Rutherford Birchard Hayes (1822–1893)

    Now that the steam engine rules the world, a title is an absurdity, still I am all dressed up in this title. It will crush me if I do not support it. The title attracts attention to myself.
    Stendhal [Marie Henri Beyle] (1783–1842)

    Syntax and vocabulary are overwhelming constraints—the rules that run us. Language is using us to talk—we think we’re using the language, but language is doing the thinking, we’re its slavish agents.
    Harry Mathews (b. 1930)