Abstract
For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions such as Deep Blue vs. Kasparov, and of the beauty of parlor games such as Checkers, Backgammon, Othello, and Go.
Multi-player games, however, have been investigated considerably less, and although literature of game theory fills books about equilibrium strategies in such games, practical experiences are rare. Recently, Korf, Sturtevant and a few others started highly interesting research activities. We focused on investigating a four-person chess variant, in order to understand the peculiarities of multi-player games without chance components. In this contribution, we present player models and search algorithms that we tested in the four-player chess world. As a result, we may state that the more successful player models can benefit from more efficient algorithms and speed, because searching more deeply leads to better results. Moreover, we present a meta-strategy, which beats a paranoid α-β player, the best known player in multi-player games.
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
de Bruin, A., Plaat, A., Schaeffer, J., Pijls, W.: A Minimax Algorithm Better than SSS*. Artificial Intelligence 87, 255–293 (1999)
Althöfer, I.: Root Evaluation Errors: How They Arise and Propagate. ICCA Journal 11(3), 55–63 (1988)
Jones, A.J.: Game theory: Mathematical Models of Conflict. Ellis Horwood, West Sussex, England (1980)
Kaindl, H., Scheucher, A.: The Reason for the Benefits of Minmax Search. In: Proc. of the 11th IJCAI, Detroit, MI, pp. 322–327 (1989)
Knuth, D.E., Moore, R.W.: An Analysis of Alpha-Beta Pruning. Artificial Intelligence 6(4), 293–326 (1975)
Lorenz, U., Monien, B.: The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 203–214. Springer, Heidelberg (2002)
Luckhardt, C.A., Irani, K.B.: An Algorithmic Solution of n-Person Games. In: Proceedings AAAI 1986, Philadelphia, PA, pp. 158–162 (1986)
Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)
Nash, J.F.: Non-Cooperative Games. Annals of Mathematics 54, 286–295 (1951)
Nau, D.S.: Pathology on Game Trees Revisited, and an Alternative to Minimaxing. Artificial Intelligence 21(1-2), 221–244 (1983)
Reinefeld, A.: An Improvement of the Scout Tree Search Algorithm. ICCA Journal 6(4), 4–14 (1983)
Schaeffer, J.: The History Heuristic and Alpha-Beta Search Enhancements in Practice. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-11(1), 1203–1212 (1989)
Shannon, C.E.: Programming a Computer for Playing Chess. Philosophical Magazine 41, 256–275 (1950)
Sturtevant, N.R.: A Comparison of Algorithms for Multi-Player Games. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 108–122. Springer, Heidelberg (2003)
Sturtevant, N.R.: Multi-player games: Algorithms and Approaches. PhD thesis, University of California, Los Angeles (2003)
Sturtevant, N.R., Korf, R.E.: On Pruning Techniques for Multi-Player Games. In: Proceedings AAAI 2000, Austin, Texas, pp. 201–207 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lorenz, U., Tscheuschner, T. (2006). Player Modeling, Search Algorithms and Strategies in Multi-player Games. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_16
Download citation
DOI: https://doi.org/10.1007/11922155_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48887-3
Online ISBN: 978-3-540-48889-7
eBook Packages: Computer ScienceComputer Science (R0)