On the complexity of tsume-go

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

Volumn 1558, Issue , 1999, Pages 222-231

  Crâşmaru, Marcel ^a  

^a SCVR   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NP COMPLETE;

COMPUTER GAMES;

EID: 80051944069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (6)

1. Lichtenstein, D. and Sipser, M., GO is Polynomial-Space Hard, Journal ACM, Vol. 27, No. 2, (April 1980) 393-401.
2. Morris, F.L., Playing Disjunctive Sums is Polynomial Space Complete, Int. Journal Game Theory, Vol. 10, No.3-4, (1981) 195-205.
3. Robson, J., The Complexity of Go, Proc. IFIP (International Federation of Information Processing), (1983) 413-417.
4. Yedwab, L., On Playing Well in a Sum of Games, Master Thesis, MIT/LCS/TR- 348, 1985.
5. Moews, D.J., On Some Combinatorial Games Connected with Go, Ph.D. Thesis, University of California at Berkeley, 1993.
6. Berlekamp, E., Wolfe, D. Mathematical Go: Chilling Gets the Last Point, A. K. Peters, 1994.