Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Conway, J.H., Berlekamp, E., Guy, R.K.: Philosopher’s football. In: Winning Ways. Academic Press (1982) 688–691
Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-moku solved by new search techniques. Computational Intelligence 12 (1996) 7–23
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–54
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–38
Cazenave, T.: Gradual abstract proof search. In: Proceedings of RFIA, Angers, France (2002)
Culberson, J., Schaeffer, J.: Pattern databases. Computational Intelligence 14(4) (1998) 318–334
Korf, R.E.: Recent progress in the design and analysis of admissible heuristic functions. In: AAAI/IAAI. (2000) 1165–1170
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.
Holte, R., Hernadvolgyi, I.: Experiments with automatically created memory-based heuristics. In: SARA-2000, Lecture Notes in Artificial Intelligence N∘ 1864 (2000) 281–290
Cazenave, T.: Synthesis of an efficient tactical theorem prover for the game of go. ACM Computing Surveys 30 (1998)
Knoblock, C.A.: Automatically generating abstractions for planning. Artificial Intelligence 68 (1994) 243–302
Prieditis, A., Davis, R.: Quantitatively relating abstractness to the accuracy of admissible heuristics. Artificial Intelligence 74 (1995) 165–175
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45622-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-45622-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43941-7
Online ISBN: 978-3-540-45622-3
eBook Packages: Springer Book Archive