← ProblemsCircuits / Sequential Logic / More Circuits
Rule 110
5%cellular-automatavectorsRule 110 is another one-dimensional cellular automaton (famously Turing-complete). Each cell's next state depends on itself and its two neighbors, where for cell q[i] the left neighbor is q[i+1] and the right neighbor is q[i-1]:
| left | center | right | next |
|---|---|---|---|
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 0 | 0 | 0 | 0 |
Build a 512-cell version, q[511:0], with the boundary cells' missing neighbors reading as 0. When load is 1, load data[511:0] into q instead of stepping. There is no reset.