More fun findings from my simple cellular automaton experiments. These are all based on the same rules:



(a) An empty cell becomes full if it has exactly one full neighbour.
(a) A full cell becomes empty if it has more than one full neighbour.


and the diagonal neighbourhood. The initial state is also the same in all cases, a 2x2 square at the centre. However, the results look very different as the canvas size is varied. In the first one, the square side is 128 cells; other powers of two make similar regular patterns. It is followed by 144, 166, 170, 176, 188 and 212 cells.


As the limits in rules (a) and (b) are very close, this is a somewhat unstable system, but the resulting patterns are still relatively static. One crucial trick is using the diagonal neighbourhood: we essentially get two independent systems offset by one pixel, like the black and white squares for Bishop's moves on a chess board. With a suitable initial set and canvas limits, the patterns in each system will line up nicely.


#cellularautomaton #patterns #texture #pixelart #retrographics #ornament #pythoncode #opengl #mathart #algorithmicart #algorist #computerart #ittaide #kuavataide #iterati

свернуть