Rule 90
From Wikipedia, the free encyclopedia
Rule 90 is a one-dimensional binary cellular automaton.
Contents |
[edit] Rule Set
The rule set which governs the next state of this particular automaton is:
| current pattern | 111 | 110 | 101 | 100 | 011 | 010 | 001 | 000 |
|---|---|---|---|---|---|---|---|---|
| new state for center cell | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
[edit] Interesting Properties
Most notably, rule 90 has the appearance of a Sierpiński triangle when responding to an impulse (first row is all 0s with a 1 in the center).
[edit] Examples
Rule 90 CA in response to an impulse, 300 iterations
 Random IC 0 |
 Random IC 1 |
 Random IC 2 |
Rule 90 CA in response to various random initial conditions
