Abstract
In this paper, we use an adaptive resolution R to enhance the min-max search with alpha-beta pruning technique, and show that the value returned by the modified algorithm, called Negascout-with-resolution, differs from that of the original version by at most R. Guidelines are given to explain how the resolution should be chosen to obtain the best possible outcome. Our experimental results demonstrate that Negascout-with-resolution yields a significant performance improvement over the original algorithm on the domains of random trees and real game trees in Chinese chess.
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
Adelson-Velskiy, G.M., Arlazarov, V.L., Donskoy, M.V.: Some methods of controlling the tree search in chess programs, pp. 129–135. Springer-Verlag New York, Inc., New York (1988)
Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic, pp. 466–473 (1977)
Atkin, L., Slate, D.: Chess 4.5-The Northwestern University chess program, pp. 80–103. Springer-Verlag New York, Inc., New York (1988)
Björnsson, Y., Marsland, T.A.: Multi-cut alpha-beta-pruning in game-tree search. Theoretical Computer Science 252(1-2), 177–196 (2001)
Levy., D., Broughton, D., Taylor, M.: The sex algorithm in computer chess. ICGA Journal 12(1) (1989)
Harris, L.R.: The heuristic search and the game of chess - a study of quiescene, sacrifices, and plan oriented play. In: Proceedings of IJCAI, pp. 334–339 (1975)
Heinz, E.A.: Extended futillity pruning. ICGA Journal 21(2), 75–83 (1998)
Jiang, A.X., Buro, M.: First experimental results of probcut applied to chess. In: Proceedings of ACG, pp. 19–32 (2003)
Kaindl, H., Shams, R., Horacek, H.: Minimax search algorithms with and without aspiration windows. IEEE Trans. Pattern Anal. Mach. Intell. 13, 1225–1235 (1991)
Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293–326 (1975)
Lim, Y., Lee, W.: Rankcut - a domain independent forward pruning method for games. In: Proceedings of AAAI (2006)
Plaat, A.: Mtd(f) a minimax algorithm faster than negascout (1997), http://people.csail.mit.edu/plaat/mtdf.html
Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87(1-2), 255–293 (1996)
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 Trans. Pattern Anal. Mach. Intell. 11(11), 1203–1212 (1989)
Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine 41(314), 256–275 (1950)
Wu, K.-C., Hsu, T.-S., Hsu, S.-C.: Contemplation wins Chinese-chess tournament. International Computer Game Association (ICGA) Journal 27(3), 172–173 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, HJ., Tsai, MT., Hsu, Ts. (2012). Game Tree Search with Adaptive Resolution. In: van den Herik, H.J., Plaat, A. (eds) Advances in Computer Games. ACG 2011. Lecture Notes in Computer Science, vol 7168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31866-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-31866-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31865-8
Online ISBN: 978-3-642-31866-5
eBook Packages: Computer ScienceComputer Science (R0)