Category Archives: majority rule

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.

An example is the majority rule automaton which you can see running in the video.  Here the rule is that each cell adopts the state that is in the majority in its neighbourhood at the next time step.

Click on the image to download and save the model NetLogo file. You will need to install NetLogo to run this file.