Admissible Moves in Two-Player Games

  • Tristan Cazenave
Conference paper

DOI: 10.1007/3-540-45622-8_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2371)
Cite this paper as:
Cazenave T. (2002) Admissible Moves in Two-Player Games. In: Koenig S., Holte R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science, vol 2371. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

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

Personalised recommendations