Evolving the Game of Life [chapter]

Dimitar Kazakov, Matthew Sweet
2005 Lecture Notes in Computer Science  
It is difficult to define a set of rules for a cellular automaton (CA) such that creatures with life-like properties (stability and dynamic behaviour, reproducton and self-repair) can be grown from a large number of initial configurations. This work describes an evolutionary framework for the search of a CA with these properties. Instead of encoding them directly into the fitness function, we propose one, which maximises the variance of entropy across the CA grid. This fitness function promotes
more » ... the existence of areas on the verge of chaos, where life is expected to thrive. The results are reported for the case of CA in which cells are in one of four possible states. We also describe a mechanism for fitness sharing that successfully speeds up the genetic search, both in terms of number of generations and CPU time.
doi:10.1007/978-3-540-32274-0_9 fatcat:alum3evr4rdvln3jpo5i6juzre