Abstract
A new algorithm based on threat analysis is proposed. It can model existing related algorithms such as Lambda Search and Abstract Proof Search. It solves 6x6 AtariGo much faster than previous algorithms. It can be used in other games. Theoretical and experimental comparisons with other related algorithms are given.
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
Thomsen, T.: Lambda-search in game trees - with application to Go. International Computer Games Association Journal 23, 203–217 (2000)
Cazenave, T.: Iterative widening. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 523–528. Morgan Kaufmann Publishers, San Francisco (2001)
Cazenave, T.: Abstract proof search. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 39–54. Springer, Heidelberg (2002)
Allis, V., van den Herik, J., Huntjens, M.: Go-moku solved by new search techniques. Computational Intelligence 12, 7–23 (1996)
Cazenave, T.: La recherche abstraite graduelle de preuves. In: Proceedings of RFIA 2002, vol. 2, pp. 615–623 (2002)
van der Werf, E.: Message to the computer Go mailing list (2002)
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
Cazenave, T. (2003). A Generalized Threats Search Algorithm. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-40031-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20545-6
Online ISBN: 978-3-540-40031-8
eBook Packages: Springer Book Archive