Cellular automata are systems which use a rule to describe the evolution of a population in a discrete lattice, while genetic algorithms are procedures designed to find solutions to optimization problems inspired by the process of natural selection. In this paper, we introduce an original implementation of a cellular automaton whose rules use a fitness function to select for each cell the best mate to reproduce and a crossover operator to determine the resulting offspring. This new system, with a proper definition, can be both a cellular automaton and a genetic algorithm. We show that in our system the Conway’s Game of Life can be easily implemented and, consequently, it is capable of universal computing. Moreover two generalizations of the Game of Life are created and also implemented with it. Finally, we use our system for studying and implementing the prisoner’s dilemma and rock-paper-scissors games, showing very interesting behaviors and configurations (e.g., gliders) inside these games.
A symbiosis between cellular automata and genetic algorithms / Cerruti, Umberto; Dutto, Simone; Murru, Nadir. - In: CHAOS, SOLITONS AND FRACTALS. - ISSN 0960-0779. - 134(2020).
|Titolo:||A symbiosis between cellular automata and genetic algorithms|
|Data di pubblicazione:||2020|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.chaos.2020.109719|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: