Skip to content

JakobStenseke/CellularAutomataElements

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Cellular Automata Elements

Cellular automata (CA) is a deeply fascinating concept. It presents proof that emergent complexity is computationally possible, i.e. that there are elements emerging from a system that require more information to be properly accounted for than the information required to run the system itself. Simply put, complexity can emerge from simplicity. Potentially our very own universe could be a program that after 13.8 billion years of runtime led to the emergence of atoms, life, and sentient creatures; phenomena vastly more complicated than the lower level phenomena generating it. Furthermore, CA can also be used to create self-replicating machines, and theoretically has the capacity of a Universal Turing Machine, meaning that anything that can be algorithmically computed can be computed with the use of certain CAs (such as Conway's Game of Life).

This project uses a stochastic version of CA based on a rock-paper-scissor rule. Just as in Pokémon, grass beats water, water beats fire, and fire beats grass, represented by the colors of the cells. For each epoch, the program iterates through every cell of the grid. One neighbor cell is randomly picked (1 in 8 chance of selecting a given neighbor). If the selected neighbor is empty (white) or contains a cell of the appropriate color -- e.g. red picking blue -- the selected neighbor gets occupied by the cells own color. The resulting effect is that a specific color expand their border, while another decrease. When three colors meet, interestingly the fluctuations start to resemble something lifelike.

The original goal of this project was to turn some version of cellular automata into a level based mobile game, presenting the player with the fun and puzzling challenges of generating various elements and phenomena. Unfortunately, I came to the conclusion that using conventional CAs made the game too deterministic and dull while stochastic cellular automaton would make it too unpredictable (the old Agon vs Alea, or skill vs RNG debate in game design). For anyone wanting to use CA in a game, I would recommend utilizing simpler deterministic systems rather than stochastic ones.

Unity is required to run it. To start, simply click any cell in order to change its color to blue, green, or red. Press play to watch the cells battle each other out in the grid.

For further reading - Stephen Wolfram (creator of Wolfram Alpha) has studied cellular automata for decades and has made many interesting findings.

Releases

No releases published

Packages

No packages published

Languages