Abstract proof search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2063, Issue , 2001, Pages 39-54

  Cazenave, Tristan ^a  

^a UNIVERSITÉ PARIS 8   (France)

Author keywords

Capture game; Computer go; Search; Theorem proving

Indexed keywords

COMPUTER GAMES; THEOREM PROVING;

ALPHA-BETA SEARCHES; BRANCHING FACTORS; CAPTURE GAME; CHESS PROGRAM; COMPUTER GO; SEARCH; SEARCH ALGORITHMS; SEARCH METHOD;

HEURISTIC METHODS;

EID: 84958743851     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_3     Document Type: Conference Paper

References (9)

1. Cazenave T.: Metaprogramming Forced Moves. Proceedings ECA198 (ed. H. Prade), pp. 645-649. John Wiley & Sons Ltd., Chichester, England. ISBN 0-471-98431-0. 1998.
2. Cazenave T.: Generating Search Knowledge in a Class of Games. submitted. http://www.ai.univ-paris8.fr/~cazenave/papers.html. 2000.
3. Frank I.: Search and Planning under Incomplete Information: a Study using Bridge Card Play. PhD Thesis, Department of Artificial Intelligence, University of Edinburgh. 1996.
4. Kano Y.: Graded Go Problems For Beginners. Volume One. The Nihon Ki-in. ISBN 4-8182-0228-2 C2376. 1985.
5. Kano Y.: Graded Go Problems For Beginners. Volume Two. The Nihon Ki-in. ISBN 4-906574-47-5. 1985.
6. Kano Y.: Graded Go Problems For Beginners. Volume Three. The Nihon Ki-in. ISBN 4-8182-0230-4. 1987.
7. Marsland T. A., Björnsson Y.: From Minimax to Manhattan. Games in AI Research, pp. 5-17. Edited by H.J. van den Herik and H. Iida, Universiteit Maastricht. ISBN 90-621-6416-1. 2000.
8. Thomsen T.: Lambda-search in game trees - with application to go. CG 2000. This volume.
9. Willmott S., Richardson J. D. C., Bundy A., Levine J. M.: Applying Adversarial Techniques to Go. Journal of Theoretical Computer Science. 2000.