An empirical comparison of evolution and coevolution for designing artificial neural network game players

  • Authors:
  • Min Shi

  • Affiliations:
  • Norwegian University of Science and Technology, Trondheim, Norway

  • Venue:
  • Proceedings of the 10th annual conference on Genetic and evolutionary computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we compare two neuroevolutionary algorithms, namely standard NeuroEvolution (NE) and NeuroEvolution of Augmenting Topologies (NEAT), with three neurocoevolutionary algorithms, namely Symbiotic Adaptive Neuro-Evolution (SANE), Enforced Sub-Populations (ESP) and Evolving Efficient Connections (EEC). EEC is a novel neurocoevolutionary algorithm that we propose in this work, where the connection weights and the connection paths of networks are evolved separately. All these methods are applied to evolve players of two different board games. The results of this study indicate that neurocoevolutionary algorithms outperform neuroevolutionary algorithms for both domains. Our new method, especially, demonstrates that fully connected networks could generate noise which results in inefficient learning. The performance of standard NE model has been improved significantly through evolving connection weights and efficient connection paths in parallel in our method.