today I will write about a new thing that I just learned over the weekend. Since it is based on a competition again I will care not to post here too much so as to be fair and not to spoil it.
Cellular automatons, at least in my knowledge so far, are in a sense, computer colonies, comprising of tons of cells. In the simplest version, you have 1-dimensional automatons which means that the cells, signified by squares let’s say, are in one row, every one of them neighboring with two other.
The cell is either dead or alive. You can create rules to make them reproduce and die, when, let’s say some cell is overcrowded. If you decide that what will happen with the cell depends on the state of the cell itself and the two neighbors and the result will always be the central cell either dead or alive there are 256 options for different rules.
This is how it would look like if the rule would be that cell always reproduces to the rest of the fields that it neighbors with but dies if the two spots around are full :
This is one of the interesting most of the 256 rules ain’t doin’ a thing but this is the rule #126 so remember that 😉
 The picture is not a line because every line of pixels is one second let’s say during which cells reproduce and die and so on, yellow means alive, purple means dead and in the beginning (top of the picture) you have only one alive.