Static analysis of life and death in the game of Go

Information sciences

Volumn 121, Issue 1, 1999, Pages 113-134

  Chen, Ken ^a   Chen, Zhixing ^b  

^a University of North Carolina at Charlotte   (United States)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC PROGRAMMING;

MACHINE GAME PLAYING;

GAME THEORY;

EID: 0033354019     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00083-3     Document Type: Article

References (12)

1. Benson D.B. Life in the game of Go. Information Sciences. 10:1976;17-29.
2. D.B. Benson, A mathematical analysis of Go, in: K. Heine (Ed.), Proceedings of the Second Seminar on Scientific Go Theory, Institut fuer Strahlenchemie, Muehlheim a.d. Ruhr, 1979, pp. 55-64.
3. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways, Academic Press, New York, 1982.
4. K. Chen, Group identification in computer Go, in: D. Levy, D. Beal (Eds.), Heuristic Programming in Artificial Intelligence, Ellis Horwood, Chichester, 1989, pp. 195-210.
5. K. Kao, Sums of hot and tepid combinatorial games, Ph.D. Thesis, University of North Carolina at Charlotte, 1997.
6. Kierulf A., Chen K., Nievergelt J. Smart game board and Go explorer: a study in software and knowledge engineering. Comm. ACM. 33(2):1990;152-166.
7. H. Landman, Eyespace values in Go, in: R. Nowakoski (Ed.), Games of No Chance, MSRI Publications 29, 1996, pp. 227-257.
8. Lichtenstein D., Sipser M. Go is polynomial-space hard. Journal of ACM. 27(2):1980;393-401.
9. M. Mueller, Computer Go as a sum of local games: an application of combinatorial game theory, Ph.D. dissertation, Swiss Federal Institute of Technology, Zurich, 1995, pp. 62-64.
10. R. Popma, V. Allis, Life and death refined, in: J. Herik, V. Allis (Eds.), Heuristic Programming in Artificial Intelligence 3, Ellis Horwood, Chichester, 1992, pp. 157-164.
11. J.M. Robson, The complexity of Go, in: Proceedings of the IFIP, 1983, pp. 413-417.
12. T. Wolf, Investigating Tsumego problems with "RisiKo", in: D. Levy, D. Beal (Eds.), Heuristic Programming in Artificial Intelligence 2, Ellis Horwood, Chichester, 1991, pp. 153-160.