So I was fooling around with Snap, seeing if I could make anything worthwhile, and I decided to implement a cellular automaton. I didn't actually look at any existing cellular automata, and I decided to make up some rules. Here they are:
- All cells except the first and last ones have two neighbors.
- The first and last cells only have one neighbor.
- A neighbor is, in reference to a center-cell, a cell that is directly in front of or behind the center-cell.
- A cell can be alive or dead, or have a value of 1 or 0 respectively.
- If both of a cell's neighbors are dead, it is to switch its state to dead. (under-population)
- If exactly one of a cell's neighbors are dead, it is to switch its state to alive. (normal population)
- If both of a cell's neighbors are alive, it is to switch its state to dead. (over-population)
So after I finished implementing the automaton, I noticed that its output is very similar to some other 1-dimensional cellular automata, so I looked it up, and it turns out I accidentally re-invented Rule 90.
It's really of no use other than watching and seeing what a "random" seed does. Feel free to cannibalize it to make some other 1-dimensional automata like Rules 110 or 184.