skip to main content
10.1145/1389095.1389164acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

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

Published: 12 July 2008 Publication History

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.

References

[1]
Gomez, F. and Miikkulainen, R., Robust Non--Linear Control through Neuroevolution, Technical Report AI-TR-03-303, The University of Texas at Austin Department of Computer Sciences August 2003.
[2]
James, D. and Tucker, P., A Comparative Analysis of Simplification and Complexification in the Evolution of Neural Network Topologies, in GECCO 2004: Proceedings of the Genetic and Evolutionary Computation Conference, Seattle, Washington, USA, 2004.
[3]
Moriarty, D. E. and Miikkulainen, R., Forming Neural Networks through Efficient and Adaptive Coevolution, Evolutionary Computation, vol. 5, pp. 373--399, 1997.
[4]
Perez-Bergquist, A. S., Applying ESP and Region Specialists to Neuro-Evolution for Go, Technical Report CSTR01-24 May 2001.
[5]
Richards, N., Moriarty, D., McQuesten, P., and Miikkulainen, R., Evolving Neural Networks to Play Go, Applied Intelligence, vol. 8, pp. 85--96, 1998.
[6]
Rosin, C. D. and Belew, R. K., Methods for Competitive Co-evolution: Finding Opponents Worth Beating in Proceedings of the Sixth International Conference on Genetic Algorithms, San Francisco, CA, 1995.
[7]
Stanley, K. O. and Miikkulainen, R., Competitive Coevolution Through Evolutionary Complexification Journal of Artificial Intelligence Research, vol. 21, pp. 63--100, 2004.
[8]
Stanley, K. O. and Miikkulainen, R., Evolving a Roving Eye for Go, in Proceedinngs of the Genetic and Evolutionary Computation Conference, 2004.
[9]
Stanley, K. O. and Miikkulainen, R., Evolving Neural Networks through Augmenting Topologies, Evolutionary Computation, vol. 10 (2), pp. 99--127, 2002.
[10]
Yao, X., Evolving Artificial Neural Networks, Proceedings of the IEEE, vol. 87, pp. 1423--1477, 1999.

Cited By

View all
  • (2009)PEECProceedings of the Eleventh conference on Congress on Evolutionary Computation10.5555/1689599.1689807(1578-1584)Online publication date: 18-May-2009
  • (2009)PEEC: Evolving efficient connections using Pareto optimality2009 IEEE Congress on Evolutionary Computation10.1109/CEC.2009.4983130(1578-1584)Online publication date: May-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
July 2008
1814 pages
ISBN:9781605581309
DOI:10.1145/1389095
  • Conference Chair:
  • Conor Ryan,
  • Editor:
  • Maarten Keijzer
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. EEC
  2. ESP
  3. NE
  4. SANE
  5. TTT
  6. gobang
  7. neat
  8. neurocoevolution
  9. neuroevolution

Qualifiers

  • Research-article

Conference

GECCO08
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2009)PEECProceedings of the Eleventh conference on Congress on Evolutionary Computation10.5555/1689599.1689807(1578-1584)Online publication date: 18-May-2009
  • (2009)PEEC: Evolving efficient connections using Pareto optimality2009 IEEE Congress on Evolutionary Computation10.1109/CEC.2009.4983130(1578-1584)Online publication date: May-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media