3.3 Totalistic automata

This model allows you to explore the behaviour of a wide variety of possible totalistic automata, i.e., cellular automata whose rules are based only on the total number of cells in each neighbourhood in each of the two allowed states. The Life CA is the best known example in this class.

Typical behaviour of this model is seen in the video below. I say typical, but really there is a such a range of behaviour it would be more accurate to describe this as a typical ‘life-like’ totalistic, but the patterns it produces are all its own.