Chapter

Computers and Games

Volume 1558 of the series Lecture Notes in Computer Science pp 222-231

Date:

On the Complexity of Tsume-Go

  • Marcel CrâŞsmaruAffiliated withSCVR Vatra Dornei

* Final gross prices may vary according to local VAT.

Get Access

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.