Abstract
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.
Cite
CITATION STYLE
Crâşmaru, M. (1999). On the complexity of tsume-go. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1558, pp. 222–231). Springer Verlag. https://doi.org/10.1007/3-540-48957-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
