wolfram's rule 30
@torshin5ergey
This project visualizes Wolfram's Rule 30, a one-dimensional binary cellular automaton identified by Stephen Wolfram. The rule is applied to a string of cells, each of which can be either 0 (white) or 1 (black). The state of each cell in the next generation depends on its current state and the state of its two immediate neighbors. Rule 30 is defined by the following transformation rules:
| Current pattern | 111 | 110 | 101 | 100 | 011 | 010 | 001 | 000 |
|---|---|---|---|---|---|---|---|---|
| New state (Rule 30) |
0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 |