Abstract
Modern computer games place different and more diverse demands on the behavior of non-player characters in comparison to computers playing classical board games like chess. Especially the necessity for a long-term strategy conflicts often with game situations that are unsteady, i.e. many non-deterministic factors might change the possible actions. As a consequence, a computer player is needed who might take into account the danger or the chance of his actions. This work examines whether it is possible to train such a player by evolutionary algorithms. For the sake of controllable game situations, the board game Kalah is turned into an unsteady version and used to examine the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlschwede, J.: Using genetic programming to play mancala (2000), http://www.corngolem.com/john/gp/index.html
Chellapilla, K., Fogel, D.B.: Anaconda defeats hoyle 6-0: A case study competing an evolved checkers program against commercially available software. In: Proc. of the 2000 Congress on Evolutionary Computation, Piscataway, NJ, pp. 857–863. IEEE Press, Los Alamitos (2000)
Davis, J.E., Kendall, G.: An investigation, using co-evolution, to evolve an awari player. In: Fogel, D.B., El-Sharkawi, M.A., Yao, X., Greenwood, G., Iba, H., Marrow, P., Shackleton, M. (eds.) Proc. of the 2002 Congress on Evolutionary Computation, Piscataway, NJ, pp. 1408–1413. IEEE Press, Los Alamitos (2002)
Donkers, J., van den Herik, H.J., Uiterwijk, J.W.H.M.: Probabilistic opponent-model search in bao. In: Rauterberg, M. (ed.) ICEC 2004. LNCS, vol. 3166, pp. 409–419. Springer, Heidelberg (2004)
Fesser, M.: Entwicklung von Spielstrategien mittels evolutionärer Algorithmen am Beispiel von Kalaha. Master’s thesis, Universität Stuttgart, Formale Methoden der Informatik. Diplomarbeit Nummer 2184 (2004)
Irving, G., Donkers, J., Uiterwijk, J.: Solving Kalah. ICCA Journal 23(3), 139–147 (2000)
Lubberts, A., Miikkulainen, R.: Co-evolving a Go-playing neural network. In: Coevolution: Turning Adaptive Algorithms upon Themselves. Birds-of-a-Feather Workshop, Gecco 2001, San Francisco, CA, pp. 14–19 (2001)
Pollack, J.B., Blair, A.D.: Pollack and Alan D. Blair. Co-evolution in the successful learning of backgammon strategy. Machine Learning 32(3), 225–240 (1998)
Rosin, C.D.: Coevolutionary Search Among Adversaries. PhD thesis, University of California, San Diego (1997)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley & Sons, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weicker, K., Weicker, N. (2009). Evolving Strategies for Non-player Characters in Unsteady Environments. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2009. Lecture Notes in Computer Science, vol 5484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01129-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-01129-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01128-3
Online ISBN: 978-3-642-01129-0
eBook Packages: Computer ScienceComputer Science (R0)