Elementary Cellular Automata (ECAs) are a simple type of cellular automata (CA) used for research and experimental algorithms. The ECA consists of a one-dimensional circular array (that is, the first and last element are adjacent), and has a rule that the next state of each element of the automaton depends on the N nearest neighbors of the element, and possibly the element itself.

This system is implemented in C# using the MonoDevelop system.