Abstract
In this paper, we use the idea of coevolution in the context of ant algorithms to develop game-playing strategies for the simple games of Nim and Tic-Tac-Toe. Since these games have a rather small set of possible non-.nal distinct states (20 for Nim and 627 for Tic-Tac-Toe), we represent a strategyas a lookup-table, specifying for each situation the suggested move. To generate such a strategy, an ant algorithm operates on a ∣S∣ × ∣M∣ pheromone matrix, with ∣S∣ being the number of possible states, and ∣M∣ being the (maximal) number of possible moves per state. We require that the sum of pheromone values in each row is equal to 1. An ant produces a strategy by moving through all the rows and probabilistically(according to the pheromone values in each row) selecting a move for each state.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
C. D. Rosin and R. K. Belew. New methods for competitive coevolution. Evolutionary Computation, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branke, J., Decker, M., Merkle, D., Schmeck, H. (2002). Coevolutionary Ant Algorithms Playing Games. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_34
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive