A first for the game, the replicator demonstrates how astounding complexity can arise from simple beginnings and processes – an echo of life’s origins, perhaps. It might help us understand how life on Earth began, or even inspire strategies to build tiny computers.
The Game of Life is the best-known example of a cellular automaton, in which patterns form and evolve on a grid according to a few simple rules. You play the game by choosing an initial pattern of “live” cells, and then watch as the configuration changes over many generations as the rules are applied over and over again (see “Take two simple rules”).
The rules of the game were laid down by mathematician John Conway in 1970, but cellular automata first took off in the 1940s when the late mathematician John von Neumann suggested using them to demonstrate self-replication in nature. This lent philosophical undertones to Life, which ended up attracting a cult following.
Life enthusiasts have since catalogued an entire zoo of interesting patterns, such as “spaceships” that travel across the grid, or “guns”, which constantly spawn other patterns. But a pattern that spawned an identical copy of itself proved elusive.
Above: Edna, the longest living soup currently known.
The Online Life-Like CA Soup Search is a collaborative online project designed to find interesting patterns in Life-like cellular automata by watching the evolution of random initial configurations (known as soups). In particular, random soups are evolved until they stabilize, and all the resulting stable patterns are uploaded to the server and catalogued. If the initial soup lived for an exceptionally long time then it is also uploaded to the server.