A tribute to John Conway, the inventor of the Game of Life. In this cellular automaton, cells can move to adjacent fields and are governed by a random matrix of attraction.
A tribute to John Conway, the inventor of the Game of Life. In this cellular automaton, cells can move to adjacent fields and are governed by a random matrix of attraction.
Each cell in the grid is either empty or has a color. A colored cell can move to an empty slot or stays where it is. Each color has a list of preferences for what it wants to be next to, so if there are 7 colors, this list has 8 elements, the first one indicating the preference for being next to an empty cell and the other 7 of how much it likes to be next to each of the colors:
When you load the page a random set of preferences is generated and the hash of the page is set to encode that preference. This makes it possible to keep track of interesting configurations.
Same colors are attracted to same colors, leading to clustering after a whileredglue.
Three colors, each attracted to the next one with the last one looping back to the first one. Keeps moving for a long time.
Five colors, all pushing each other away, leading to nice dialogonal patterns.
Five colors, each attracted to the next one with the last one looping back to the first one. Produces banded colored stuff.
Only red cells can make connections, so any cluster has at least one red cell in the middle.