Abstract
Best-Reply Search (BRS) is a new search technique for game-tree search in multi-player games. In BRS, the exponentially many possibilities that can be considered by opponent players is flattened so that only a single move, the best one among all opponents, is chosen. BRS has been shown to outperform the classic search techniques in several domains. However, BRS may consider invalid game states. In this paper, we improve the BRS search technique such that it preserves the proper turn order during the search and does not lead to invalid states. The new technique, BRS\(^+\), uses the move ordering to select moves at opponent nodes that are not searched. Empirically, we show that BRS\(^+\) significantly improves the performance of BRS in Four-Player Chess, leading to winning 8.3 %–11.1 % more games against the classic techniques max\(^n\) and Paranoid, respectively. When BRS\(^+\) plays against max\(^n\), Paranoid, and BRS at once, it wins the most games as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
For brevity, we use ‘he’ and ‘his’ whenever ‘he or she’ and ‘his or her’ are meant.
- 2.
By “most recent” we mean the path with the shortest such sequence of moves.
- 3.
We assume, without loss of generality, that the game has a strictly alternating turn order, so \(P(\mathcal {T}(s,a))\) will be the same \(\forall a \in \mathcal {A}(s)\).
References
Campbell, M., Hoane Jr, A.J., Hsu, F.: Deep blue. Artif. Intell. 134(1–2), 57–83 (2002)
Esser, M.: Best-reply search in multi-player chess. Master’s thesis, Department of Knowledge Engineering, Maastricht University (2012)
Gras, M.: Multi-player search in the game of billabong. Master’s thesis, Department of Knowledge Engineering, Maastricht University (2012)
Lorenz, U., Tscheuschner, T.: Player modeling, search algorithms and strategies in multi-player games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T., Donkers, H.H.L.M.J. (eds.) CG 2005. LNCS, vol. 4250, pp. 210–224. Springer, Heidelberg (2006)
Luckhart, C.A., Irani, K.B.: An algorithmic solution of n-person games. In: AAAI’86, pp. 158–162 (1986)
Nijssen, J.A.M., Winands, M.H.M.: Search policies in multi-player games. ICGA J. 36(1), 3–21 (2013)
Schadd, M.P.D., Winands, M.H.M.: Best reply search for multi-player games. IEEE Trans. Comput. Intell. AI Game 3(1), 57–66 (2011)
Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317(5844), 1518–1522 (2007)
Sturtevant, N.R.: An analysis of UCT in multi-player games. ICGA J. 31(4), 195–208 (2008)
Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 201–207 (2000)
Tesauro, G.: Temporal difference learning and TD-Gammon. Commun. ACM 38(3), 58–68 (1995)
Tscheuschner, T.: Four-person chess (Paderborn rules) (2005)
Zuckerman, I., Felner, A.: The MP-Mix algorithm: Dynamic search strategy selection in multiplayer adversarial search. IEEE Trans. Comput. Intell. AI Game 3(4), 316–331 (2011)
Acknowledgments
We would like to thank Nathan Sturtevant for the suggestion of Rand-Top-\(k\) and Pim Nijssen for his help with multi-player search algorithms. This work is partially funded by the Netherlands Organisation for Scientific Research (NWO) in the framework of the project Go4Nature, grant number 612.000.938.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Esser, M., Gras, M., Winands, M.H.M., Schadd, M.P.D., Lanctot, M. (2014). Improving Best-Reply Search. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-09165-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09164-8
Online ISBN: 978-3-319-09165-5
eBook Packages: Computer ScienceComputer Science (R0)