Category Archives: Cellular automata
Basic parity rule – sample images
To get smoother images I first use Gauss-blur and then a threshold filter. Here I am showing results for the parity rule on the hexagonal lattice with the von Neumann neighborhood. You get more details in my earlier post “The … Continue reading
Imitating snowflakes with a simple cellular automation
In an earlier post “Fake snowflakes” I already created images that resemble snowflakes. I used a rather complicated method. Now I have found a much simpler cellular automaton that gives similar results. Again I use a hexagonal lattice. Each cell … Continue reading
Further images from hexagonal cellular automatons
I continue to pursue my main interest – to create geometric images. Thus I have tried new recipes for cellular automatons on the hexagonal lattice. The cells have either state 1 or 0. To get symmetric images we start with … Continue reading
Conway’s game of life on a hexagonal lattice
Out of curiosity I searched for a similar cellular automaton as Conway’s game of life on a hexagonal lattice. It should have gliders and use the Moore neighborhood as defined in the earlier post “hexagonal cellular automata“. I found gliders … Continue reading
a general parity rule and another example
To find the future state of a cell we choose some cells around the cell. This may include the cell itself. Then we calculate the sum of the states of these cells. If it is odd, the cell will have … Continue reading
The modified parity rule
A small change of the parity rule gives us new interesting images. In addition to the states of the six nearest neighbors of a cell we count the state of the cell itself too. The cell has state =1 in … Continue reading
parity rule – the video
In the last post I did not do a good description how the cellular automaton with parity rule evolves on a hexagonal lattice. Thus I made a video using the von Neumann neighborhood. You can see reappearing inflating generations with … Continue reading
