# Elementary Cellular Automaton

While working on Game Of Life - I’ve became interested in Cellular Automation, and found another interesting example to do - Elementary cellular automaton. According to Wikipedia, “… an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbors.” It was Super simple, right? But it was well challenging for me as for a novice programmer, and also lead to some new knowledge and understanding of what’s going on. It’s 255 different rules instead of three in Game Of Life, but they do not implement simultaniously, one rule per one automata. There is a big list of all the rules can be found here. The most interesting ones I used in my project. Also, this automata is kind of boring and I added some colour fun. So, take a look!

Source code, as always on my github: SOURCE

Select rule:
Select first row:

Select cell color:
Select canvas color:
Psychedelic mode:
ON