A Generalized Threats Search Algorithm

  • Tristan Cazenave
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2883)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Thomsen, T.: Lambda-search in game trees - with application to Go. International Computer Games Association Journal 23, 203–217 (2000)Google Scholar
  2. 2.
    Cazenave, T.: Iterative widening. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 523–528. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
  3. 3.
    Cazenave, T.: Abstract proof search. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 39–54. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Allis, V., van den Herik, J., Huntjens, M.: Go-moku solved by new search techniques. Computational Intelligence 12, 7–23 (1996)CrossRefGoogle Scholar
  5. 5.
    Cazenave, T.: La recherche abstraite graduelle de preuves. In: Proceedings of RFIA 2002, vol. 2, pp. 615–623 (2002)Google Scholar
  6. 6.
    van der Werf, E.: Message to the computer Go mailing list (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tristan Cazenave
    • 1
  1. 1.Labo IAUniversité Paris 8France

Personalised recommendations