Player Modeling, Search Algorithms and Strategies in Multi-player Games
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.
KeywordsGame Tree Player Type Search Depth Strong Player Chess Game
Unable to display preview. Download preview PDF.
- 1.de Bruin, A., Plaat, A., Schaeffer, J., Pijls, W.: A Minimax Algorithm Better than SSS*. Artificial Intelligence 87, 255–293 (1999)Google Scholar
- 2.Althöfer, I.: Root Evaluation Errors: How They Arise and Propagate. ICCA Journal 11(3), 55–63 (1988)Google Scholar
- 4.Kaindl, H., Scheucher, A.: The Reason for the Benefits of Minmax Search. In: Proc. of the 11th IJCAI, Detroit, MI, pp. 322–327 (1989)Google Scholar
- 7.Luckhardt, C.A., Irani, K.B.: An Algorithmic Solution of n-Person Games. In: Proceedings AAAI 1986, Philadelphia, PA, pp. 158–162 (1986)Google Scholar
- 8.Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)Google Scholar
- 11.Reinefeld, A.: An Improvement of the Scout Tree Search Algorithm. ICCA Journal 6(4), 4–14 (1983)Google Scholar
- 15.Sturtevant, N.R.: Multi-player games: Algorithms and Approaches. PhD thesis, University of California, Los Angeles (2003)Google Scholar
- 16.Sturtevant, N.R., Korf, R.E.: On Pruning Techniques for Multi-Player Games. In: Proceedings AAAI 2000, Austin, Texas, pp. 201–207 (2000)Google Scholar