Corpus ID: 7636593

Generating Interesting Patterns in Conway ’ s Game of Life Through a Genetic Algorithm

  title={Generating Interesting Patterns in Conway ’ s Game of Life Through a Genetic Algorithm},
  author={H{\'e}ctor Alfaro},
In this paper we describe the application of a genetic algorithm to John Conway’s Game of Life, a popular form of Cellular Automata. Our intent is to create an arrangement of cellular automata (CA) that will produce “interesting” behavior when placed into Conway’s Game of Life – where “interesting” behavior includes repeated patterns, reproducing groups of cells, and patterns that change their location in Life. We also discuss techniques for improving algorithm performance by applying methods… Expand


Evolving the Game of Life
This work describes an evolutionary framework for the search of a CA with life-like properties that maximises the variance of entropy across the CA grid, and proposes a mechanism for fitness sharing that successfully speeds up the genetic search. Expand
Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work
The work described here is the first step in employing GAs to engineer useful emergent computation in decentralized multi-processor systems and is also a step in understanding how an evolutionary process can produce complex systems with sophisticated collective computational abilities. Expand
Statistical mechanics of cellular automata
Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of aExpand
Mathematical games: the fantastic combinations of john conway's new solitaire game "life
In 1967 he discovered a new group-some call it "Conway's constellation"--that includes all but two of the then known sporadic groups, a breakthrough that has had exciting repercussions in both group theory and number theory. Expand
Genetic Algorithms for Tracking Changing Environments
This paper contrasts three different strategies: the Standard GA using a constant level of mutation, a mechanism called Random Immigrants, that replaces part of the population each generation with randomly generated values, and an adaptive mechanism called Triggered Hypermutation that increases the mutation rate whenever there is a degradation in the performance of the time-averaged best performance. Expand
Genetic Algorithms for Changing Environments
This paper presents a modification of the standard generational genetic algorithm that is designed to maintain the diversity required to track a changing response surface and shows some promise for the new technique. Expand
An Introduction to Genetic Algorithms.
An Introduction to Genetic Algorithms is one of the rare examples of a book in which every single page is worth reading. The author, Melanie Mitchell, manages to describe in depth many fascinatingExpand
Optimization of Control Parameters for Genetic Algorithms
  • J. Grefenstette
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics
  • 1986
GA's are shown to be effective for both levels of the systems optimization problem and are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems. Expand
Scale‐Free and Hierarchical Structures in Complex Networks
Networks with complex topology describe systems as diverse as the cell or the World Wide Web. The emergence of these networks is driven by self-organizing processes that are governed by simple butExpand
Collective control of nest climate parameters in bumblebee colonies
The proportion of the total workforce invested by colonies in nest ventilation did not change significantly; thus, the number of fanning workers increased with colony size, and as colony size increased, the dynamics of the colony response changed: colonies responded faster to perturbations of their environment when they were large (60 or more individuals) than when they was small. Expand