Abstract
Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we describe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program.
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
Hsu, F.: IBM’s Deep Blue chess grandmaster chips. IEEE Micro. 19, 70–81 (1999)
Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, Heidelberg (1997)
Buro, M.: The Othello match of the year: Takeshi Murakami vs. Logistello. International Computer Chess Association Journal 20, 189–193 (1997)
Müller, M.: Review: Computer Go 1984-2000. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 405–413. Springer, Heidelberg (2002)
Matsubara, H., Iida, H., Grimbergen, R.: Natural developments in game research: From chess to shogi to Go. International Computer Chess Association Journal 19, 103–112 (1996)
Takizawa, T., Grimbergen, R.: Review: Computer shogi through 2000. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 433–442. Springer, Heidelberg (2002)
Müller, M., Tegos, T.: Experiments in computer Amazons. In: Nowakowski, R. (ed.) More Games of No Chance, pp. 243–260. Cambridge University Press, Cambridge (2001)
Buro, M.: Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 250–261. Springer, Heidelberg (2002)
Hensgens, P.: A knowledge-based approach of the game of Amazons. Master’s thesis, Department of Informatics, Universiteit Maastrict (2001) Technical report CS 01-09
Reinfeld, A.: An improvement to the Scout tree search algorithm. International Computer Chess Association Journal 6, 4–14 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avetisyan, H., Lorentz, R.J. (2003). Selective Search in an Amazons Program. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds) Computers and Games. CG 2002. Lecture Notes in Computer Science, vol 2883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40031-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-40031-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20545-6
Online ISBN: 978-3-540-40031-8
eBook Packages: Springer Book Archive