CYCLIC-SPACE CELLULAR AUTOMATON
From chaos to order.

Watch the pattern evolves into demons (stable pattern of spirals). It may take a while on slower machines.  Click the Restart button to re-randomize the pattern.  Once the pattern is stable, press
A to zoom in; Z to zoom out.

This is an implementation of a cyclic-space model cellular automata (CA).  A CA evolves by a set of rules to determine the state of the next generation. This CA uses the following rules:

  • Determine a maximum-value (max-val).
  • Initialize a 2D array with random values between 0 and max-val.
  • If a cell has at least one neighbor which value is higher by 1, that cell is eaten by the neighbor (the value changes to the value of the neighbor).
  • A cells with a value of max-value can only be eaten by cells with a value of 0.   In that case, the value cycles to 0, thus the name cyclic-space.
  • Repeat the last 2 steps.

Recommended machine: 133 Mhz or faster. 
Applet Programmed by F. Permadi 

Acknowledgement:

  • This type of cellular automaton was developed by David Griffeath (Univ. of Wisconsin).
  • The term cyclic space was coined by A. K. Dewdney (Scientific American, August 1989).