Cyclic Cellular Automaton

What is This?

A Cyclic Cellular Automaton (CCA) is a simple yet powerful algorithm that operates on a grid of cells, each of which can be in one of several states. The algorithm progresses through each "step" or iteration, where each cell's state at the current step is determined by its own state and the states of its neighboring cells at the previous step.

The CCA algorithm follows a cyclic pattern, meaning that the states of cells are updated in a circular manner, looping back to the beginning once the end is reached. This cyclic behavior gives rise to fascinating emergent patterns and dynamic behaviors.

The Rules

Some Fun Examples