Co-Evolution in the Successful Learning of Backgammon Strategy
Machine Learning
Blondie24: playing at the edge of AI
Blondie24: playing at the edge of AI
Pareto Optimality in Coevolutionary Learning
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Solution concepts in coevolutionary algorithms
Solution concepts in coevolutionary algorithms
The MaxSolve algorithm for coevolution
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
DECA: dimension extracting coevolutionary algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A Monotonic Archive for Pareto-Coevolution
Evolutionary Computation
New methods for competitive coevolution
Evolutionary Computation
Evolving strategy for a probabilistic game of imperfect information using genetic programming
Genetic Programming and Evolvable Machines
Coevolutionary temporal difference learning for Othello
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Winning ant wars: evolving a human-competitive game strategy using fitnessless selection
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Evolving small-board Go players using coevolutionary temporal difference learning with archives
International Journal of Applied Mathematics and Computer Science
Observing the evolution of neural networks learning to play the game of Othello
IEEE Transactions on Evolutionary Computation
Improving Generalization Performance in Co-Evolutionary Learning
IEEE Transactions on Evolutionary Computation
Shaping fitness function for evolutionary learning of game strategies
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Quantitative analysis of the hall of fame coevolutionary archives
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
Recent developments cast doubts on the effectiveness of coevolutionary learning in interactive domains. A simple evolution with fitness evaluation based on games with random strategies has been found to generalize better than competitive coevolution. In an attempt to investigate this phenomenon, we analyze the utility of random opponents for one and two-population competitive coevolution applied to learning strategies for the game of Othello. We show that if coevolution uses two-population setup and engages also random opponents, it is capable of producing equally good strategies as evolution with random sampling for the expected utility performance measure. To investigate the differences between analyzed methods, we introduce performance profile, a tool that measures the player's performance against opponents of various strength. The profiles reveal that evolution with random sampling produces players coping well with mediocre opponents, but playing relatively poorly against stronger ones. This finding explains why in the round-robin tournament, evolution with random sampling is one of the worst methods from all those considered in this study.