forked from YovM/Algorithms
* fix typo * fix typo * fix typos * fix typo |
||
|---|---|---|
| .. | ||
| README.md | ||
| __init__.py | ||
| conways_game_of_life.py | ||
| game_of_life.py | ||
| langtons_ant.py | ||
| nagel_schrekenberg.py | ||
| one_dimensional.py | ||
| wa_tor.py | ||
README.md
Cellular Automata
Cellular automata are a way to simulate the behavior of "life", no matter if it is a robot or cell. They usually follow simple rules but can lead to the creation of complex forms. The most popular cellular automaton is Conway's Game of Life.