One Algorithm, 12 depictions:
Cellular automata are systems capable of producing
fascinating structures from simple rules.
This website invites you to visually explore the principle
of elementary cellular automata.

Explore What are elementary cellular automata?


How do elementary cellular automata work?

Imagine an array of identical elements – the cells.
Each cell may have one of two different states:
black or white, 1 or 0, active or inactive – anything is possible.
Let's go for the black and white example here.
The cells all change their state in discrete time intervals.
How the cells change is determined by the automaton's ruleset.
How does the ruleset work?
Each cell has a neighbourhood that includes of itself and the cells to the left and right.
The new state of a cells depends solely
on the state of its neighbourhood.
These are the eight possiblities how it may look like.
The ruleset defines which new state is taken by the middle cell for any of these possibilities.
If the cell array is linear, it is limited to the left and right.
If it is ring-shaped, the cells are connected to a circle.
The programs on this website depict the cell room, cells and their states in different ways. The simple visualization as black and white squares on the right display serves as comparison.

About this project

Zellmemore is part of Franziska Schneider's bachelor thesis. If you are further interested, you can read the documentation here (in German) or visit Zellmemore on Github.
All visualizations were created with p5.js.