# Selfish Elementary Cellular Automata

Selfish Elementary Cellular Automata

A selfish automaton uses its initial conditions as its current rule. The result is then used as the new initialization and the new rule, and so on. Most elementary 8-bit selfish automata reach fixed points quickly, but number 118 evolves 15 generations. Evolutions of all possible 8-bit initializations are plotted by converting all their 8-bit states into the integers between 0 and 255. Select an initialization/rule to see the red line trace its evolution.