Application of Monte-Carlo Tree Search in Tsumego of Computer Go

Abstract

The Tsumego problem in Go is a basic and essential problem to be overcome in implementing a computer Go program. This paper proposed a reality of Monte-Carlo tree search in Tsumego of computer Go which using Monte-Carlo evaluation as an alternative for a positional evaluation function. The advantage of this technique is that it requires few domain knowledge or expert input.