Admissible Moves in Two-Player Games

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


Some games have abstract properties that can be used to design admissible heuristics on moves. These admissible heuristics are useful to speed up search. They work well with depth-bounded search algorithms such as Gradual Abstract Proof Search that select moves based on the distance to the goal. We analyze the benefits of these admissible heuristics on moves for rules generation and search. We give experimental results that support our claim for the game of AtariGo.


Attack Move Abstract Knowledge Empty Intersection Abstract Proof Admissible Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Conway, J.H., Berlekamp, E., Guy, R.K.: Philosopher’s football. In: Winning Ways. Academic Press (1982) 688–691Google Scholar
  2. 2.
    Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-moku solved by new search techniques. Computational Intelligence 12 (1996) 7–23CrossRefGoogle Scholar
  3. 3.
    Cazenave, T.: Abstract proof search. In Marsland, T. A., Frank, I., eds.: Computers and Games. Volume 2063 of Lecture Notes in Computer Science., Springer (2002) 39–54CrossRefGoogle Scholar
  4. 4.
    Thomsen, T.: Lambda-search in game trees-with application to go. In Marsland, T.A., Frank, I., eds.: Computers and Games. Volume 2063 of Lecture Notes in Computer Science., Springer (2002) 19–38CrossRefGoogle Scholar
  5. 5.
    Cazenave, T.: Gradual abstract proof search. In: Proceedings of RFIA, Angers, France (2002)Google Scholar
  6. 6.
    Culberson, J., Schaeffer, J.: Pattern databases. Computational Intelligence 14(4) (1998) 318–334CrossRefMathSciNetGoogle Scholar
  7. 7.
    Korf, R.E.: Recent progress in the design and analysis of admissible heuristic functions. In: AAAI/IAAI. (2000) 1165–1170Google Scholar
  8. 8.
    Cazenave, T.: Generation of patterns with external conditions for the game of go. In van den Herik, H., Monien, B., eds.: Advance in Computer Games 9. Universiteit Maastricht, Maastricht (2001) 275–293 ISBN 90 6216 566 4.Google Scholar
  9. 9.
    Holte, R., Hernadvolgyi, I.: Experiments with automatically created memory-based heuristics. In: SARA-2000, Lecture Notes in Artificial Intelligence N∘ 1864 (2000) 281–290Google Scholar
  10. 10.
    Cazenave, T.: Synthesis of an efficient tactical theorem prover for the game of go. ACM Computing Surveys 30 (1998)Google Scholar
  11. 11.
    Knoblock, C.A.: Automatically generating abstractions for planning. Artificial Intelligence 68 (1994) 243–302zbMATHCrossRefGoogle Scholar
  12. 12.
    Prieditis, A., Davis, R.: Quantitatively relating abstractness to the accuracy of admissible heuristics. Artificial Intelligence 74 (1995) 165–175CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Tristan Cazenave
    • 1
  1. 1.Labo IAUniversité Paris 8St-DenisFrance

Personalised recommendations