The N-strikes-out algorithm: A steady-state algorithm for coevolution

Channon

Abstract

We introduce the N-strikes-out algorithm, a simple steady-state genetic algorithm for competitive coevolution. The algorithm can be summarised as follows: Run competitions between randomly chosen individuals, keep track of the number of defeats for each individual, and remove any individual which has been defeated N times. Naive application of the algorithm in 2-population problems leads to severe disengagement. We find that disengagement can be eliminated (for all tasks involving real-valued continuous scores) by determining 'victories' and 'defeats' between fellow members of the same species, using competitions against a single member of the opposing species as a point of comparison. We apply our algorithm to the "box-grabbing" problem for artificial 3D creatures introduced by Sims. We compare our algorithm with Sims' original Last Elite Opponent algorithm, and describe (and explain) different results obtained with two different implementations differing mainly by the harshness of their selection regimes.

Citation

Channon. (2006). The N-strikes-out algorithm: A steady-state algorithm for coevolution

• Acceptance Date: Jul 16, 2006
• Publication Date: Jul 16, 2006
• Journal: 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6
• Pages: 1639 - 1646
• ISBN: 978-0-7803-9487-2
• Keywords: Computer games, genetic algorithms, 2-population problems, N-strikes-out algorithm, Sims, artificial 3D creatures, box-grabbing problem, competitive coevolution, last elite opponent algorithm, run competitions, steady-state genetic algorithm, Arm, Fellows, Genetic algorithms, Joining processes, Roads, Steady-state, Technological innovation, Testing
• Public URL: https://keele-repository.worktribe.com/output/403333