论文信息 - Admissible Moves in Two-Player Games

Admissible Moves in Two-Player Games

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.

Tristan Cazenave

[1] Richard E. Korf,et al. Recent Progress in the Design and Analysis of Admissible Heuristic Functions , 2000, AAAI/IAAI.

[2] Robert C. Holte,et al. Experiments with Automatically Created Memory-Based Heuristics , 2000, SARA.

[3] H. Jaap van den Herik,et al. GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES , 1996, Comput. Intell..

[4] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[5] Thomas Thomsen. Lambda-Search in Game Trees - with Application to Go , 2000, Computers and Games.

[6] Thomas Thomsen. Lambda-Search in Game Trees - with Application to Go , 2000, J. Int. Comput. Games Assoc..

[7] Tristan Cazenave. Gradual Abstract Proof Search , 2002, J. Int. Comput. Games Assoc..

[8] Tristan Cazenave,et al. Synthesis of an efficient tactical theorem prover for the game of go , 1998, CSUR.

[9] Tristan Cazenave,et al. Abstract Proof Search , 2000, Computers and Games.

[10] Labo IA Saint-Denis. GENERATION OF PATTERNS WITH EXTERNAL CONDITIONS FOR THE GAME OF GO , 2001 .

[11] Robert Davis,et al. Quantitatively Relating Abstractness to the Accuracy of Admissible Heuristics , 1995, Artif. Intell..

[12] Larry S. Davis,et al. Pattern Databases , 1979, Data Base Design Techniques II.