Metarules to improve tactical Go knowledge

Information Sciences

Volumn 154, Issue 3-4 SPEC., 2003, Pages 173-188

  Cazenave, Tristan ^a  

^a UNIVERSITÉ PARIS 8   (France)

Author keywords

Game of Go; Metaknowledge; Pattern databases; Retrograde analysis; Search

Indexed keywords

DATABASE SYSTEMS; GAME THEORY; KNOWLEDGE BASED SYSTEMS;

PATTERN DATABASES;

INFORMATION SCIENCE;

EID: 0037668918     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00049-5     Document Type: Article

References (21)

1. T. Cazenave, Système d'Apprentissage Par Auto-Observation. Application au jeu de Go, Ph.D. thesis, Université Paris 6, December, 1996.
2. Cazenave T. Generation of patterns with external conditions for the game of Go. van den Herik H., Monien B. Advance in Computer Games 9. 2001;275-293 Universiteit Maastricht, Maastricht.
3. Bouzy B., Cazenave T. Computer Go: an AI-oriented survey. Artif. Intell. 132(1):2001;39-103.
4. Benson D. Life in the game of Go. Inform. Sci. 10:1976;17-29.
5. Kraszek J. Heuristics in the life and death algorithm of a Go-playing program. Comp. Go. 9:1988;13-24.
6. Chen K. Group identification in computer Go. Levy D., Beal D. Heuristic Programming in Artificial Intelligence: The First Computer Olympiad. 1989;195-210 Ellis Horwood, Chichester.
7. Chen K. The move decision process of Go Intellect. Comp. Go. 14:1990;9-17.
8. Chen K., Chen Z. Static analysis of life and death in the game of Go. Inform. Sci. 121:1999;113-134.
9. Wolf T. Investigating tsumego problems with RisiKo. Levy D., Beal D. Heuristic Programming in Artificial Intelligence 2. 1991;Ellis Horwood.
10. Wolf T. The program GoTools and its computer-generated tsume go database. Matsubara H. Game Programming Workshop in Japan '94. 1994;84-96 Computer Shogi Association, Tokyo, Japan.
11. Wolf T. About problems in generalizing a tsumego program to open positions. Matsubara H. Game Programming Workshop in Japan '96. 1996;20-26 Computer Shogi Association, Tokyo, Japan.
12. Wolf T. The diamond. Brit. Go J. 108:1997;34-36.
13. Wolf T. Forward pruning and other heuristic search techniques in tsume go. Inform. Sci. 122:2000;59-76.
14. D. Dyer, web page: An eye shape library for computer Go.
15. Gasser R. Endgame database compression for humans and machines. van den Herik H., Allis L. Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad. 1991;180-191 Ellis Horwood, Chichester, England.
16. Minton S. Quantitative results concerning the utility of explanation based learning. Artif. Intell. 42(2-3):1990;363-392.
17. Cazenave T. Abstract proof search. Marsland T.A., Frank I. Computers and Games, Vol. 2063 of Lecture Notes in Computer Science. 2001;39-54 Springer.
18. T. Cazenave, Theorem proving in the game of Go, in: Proceedings of the first International Conference on Baduk, Yong-In, Korea, 2001, pp. 275-292.
19. T. Cazenave, La recherche abstraite graduelle de preuves, in: Proceedings of RFIA-02, Angers, France, 2002, pp. 615-623.
20. Ramon J., Francis T., Blockeel H. Learning a Tsume-Go heuristic with Tilde. Marsland T.A., Frank I. Computers and Games, Vol. 2063 of Lecture Notes in Computer Science. 2001;151-169 Springer.
21. T. Cazenave, A problem library for computer Go, in: H.H. Hoos, T. Stuetzle (Eds.), IJCAI-01 Workshop on Empirical Methods in Artificial Intelligence, Seattle, USA, 2001.