On the Complexity of Tsume-Go
In this paper, we explain why Go is hard to be programmed. Since the strategy of the game is closely related to the concept of alive-dead group, it is plainly necessary to analyze this concept. For this a mathematical model is proposed. Then we turn our research to Tsume-Go problems in which one of the players has always a unique good move and the other has always only two good moves available to choose from. We show that this kind of problems are NP-complete.
Unable to display preview. Download preview PDF.
- 3.Robson, J., The Complexity of Go, Proc. IFIP (International Federation of Information Processing), (1983) 413–417.Google Scholar
- 4.Yedwab, L., On Playing Well in a Sum of Games, Master Thesis, MIT/LCS/TR-348, 1985.Google Scholar
- 5.Moews, D.J., On Some Combinatorial Games Connected with Go, Ph.D. Thesis, University of California at Berkeley, 1993.Google Scholar
- 6.Berlekamp, E., Wolfe, D. Mathematical Go: Chilling Gets the Last Point, A.K.Peters, 1994.Google Scholar