Abstract
In Probabilistic Opponent-Model search (PrOM search) the opponent is modelled by a mixed strategy of N opponent types ω 0 ... ω N − − 1. The opponent is assumed to adopt at every move one of the opponent types ω i according to the probability Pr(ω i ). We hypothesize that PrOM search is a better search mechanism than Opponent-Model search (OM search) and Minimax search. In this paper we investigate two questions: (1) to which extent is PrOM search better than OM search and Minimax search in the game of Bao? and (2) which opponent type is most advantageous to use? To answer the second question we constructed Five evaluation functions which we applied in a tournament consisting of 352,000 games. Our conclusions are twofold: (1) in Bao, PrOM search performs better than OM search and sometimes also better than Minimax search even when no perfect information of the opponent is available, and (2) for an adequate performance of PrOM search, emphasis on the own evaluation function in the opponent model should be higher than assumed so far.
This is a preview of subscription content, log in via an institution to check access.
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
Anantharaman, T.: Evaluation tuning for computer chess: Linear discriminant methods. ICCA Journal 20(4), 224–242 (1997)
Baxter, J., Trigdell, A., Weaver, L.: KnightCap: a chess program that learns by combining TD(¸) with game-tree search. In: Proc. 15th International Conf. on Machine Learning, pp. 28–36. Morgan Kaufmann, San Francisco (1998)
Carmel, D., Markovitch, S.: Learning and using opponent models in adversary search. Technical Report CIS9609, Technion, Haifa, Israel (1996)
Carmel, D., Markovitch, S.: Pruning algorithms for multi-model adversary search. Artificial Intelligence 99(2), 325–355 (1998)
Donkers, H.H.L.M., Uiterwijk, J.W.H.M.: Programming Bao. Seventh Computer Olympiad: Computer-Games Workshop Proceedings (ed. J.W.H.M. Uiterwijk), Technical Reports in Computer Science, CS 02-03, IKAT, Department of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands (2002)
Donkers, H.H.L.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Probabilistic opponent-model search. Information Sciences 135(3-4), 123–149 (2001)
Donkers, H.H.L.M., Uiterwijk, J.W.H.M., de Voogt, A.J.: Mancala games – topics in artificial intelligence and mathematics Step by Step. In: Retschitzki, J., Haddad-Zubel, R. (eds.) Proceedings of the 4th Colloquium ‘Board Games in Academia’, Editions Universitaires, Fribourg, Switserland (2002)
Donkers, H.H.L.M.: Nosce Hostem: Searching with Opponent Models. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (2003)
Donkers, H.H.L.M., Uiterwijk, J.W.H.M., Herik, H.J., van den Herik, H.J.: Admissibility in opponent-model search. Information Sciences 154(3-4), 119–140 (2003)
Fürnkranz, J.: Machine learning in computer chess: The next generation. ICCA Journal 19(3), 147–161 (1996)
van den Herik, H.J., van den Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved, now and in the future. Artificial Intelligence 134(1-2), 277–311 (2002)
Holland, J.H.: Adaption in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Iida, H., Uiterwijk, J.W.H.M., van den Herik, H.J., Herschberg, I.S.: Potential applications of opponent-model search. Part 1: the domain of applicability. ICCA Journal 16(4), 201–208 (1993)
Iida, H., Kotani, I., Uiterwijk, J.W.H.M., van den Herik, H.J.: Gains and risks of OM search. In: van den Herik, H.J., Uiterwijk, J.W.H.M. (eds.) Advances in Computer Chess 8, Universiteit Maastricht, Maastricht, The Netherlands, pp. 153–165.
Murray, H.J.R.: A History of Board Games other than Chess. Oxford University Press, Oxford (1952)
Russ, L.: The Complete Mancala Games Book. Marlow & Company, New York (2000)
de Voogt, A.J.: Limits of the Mind. Towards a Characterisation of Bao Mastership. Ph.D. thesis, University of Leiden, The Netherlands (1995)
Yoshioka, T., Ishii, S., Ito, M.: Strategy acquisition for the game othello based on reinforcement learning. IEICE Transactions on Information and Systems E82-D(12), 1618–1626 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Donkers, J., van den Herik, J., Uiterwijk, J. (2004). Probabilistic Opponent-Model Search in Bao. In: Rauterberg, M. (eds) Entertainment Computing – ICEC 2004. ICEC 2004. Lecture Notes in Computer Science, vol 3166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28643-1_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-28643-1_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22947-6
Online ISBN: 978-3-540-28643-1
eBook Packages: Springer Book Archive