My new cellular automaton! Here's how it works: There are cells and rules. The cells follow the rules. This is the basics of all types of cellular automata. In this type of cellular automaton, cells can have 4 states: empty, red, yellow, green and blue. Here are the rules: 1 - If an empty cell has 2 red neighbours, it turns red. 2 - If an empty cell has 4 red neighbours, it turns yellow. 3 - If an empty cell has 1 blue neighbour, it turns blue, if it doesn't have 2 red neighbours. 4 - If a red cell is touching a yellow cell, it turns yellow, always. 5 - If a red cell is touching a green cell, it turns empty, unless it has a yellow neighbour. 6 - If a red cell has 2 red neighbours, it stays red, unless it has a yellow neighbour. 7 - If a red cell doesn't have 2 red neighbours or a yellow neighbour, it turns empty. 8 - If a yellow cell has 2 or 3 yellow neighbours, it stays yellow. 9 - If a yellow cell doesn't have 2 or 3 yellow cells, it turns empty. 10 - If a green cell doesn't have a blue neighbour, it turns red. 11 - If a green cell doesn't have a yellow neighbour, it turns red. 12 - If a green cell doesn't have a red neighbour, it turns red. 13 - If a green cell doesn't have a red, green or yellow neighbour it turns red. 14 - If a green neighbour has a yellow or red neighbour, it stays green. 15 - If a blue cell has 3 blue neighbours, it stays blue. 16 - If a blue cell is touching a green neighbour, it turns empty. 17 - If a blue cell doesn't have 3 blue neighbours or a green neighbour, it turns empty.
This project mimics cell interaction and formation, but not movement. [space] for editor [<] and [>] to select items [v] to clear grid
