Modification of UCT Algorithm with Quiescent Search in Computer GO

The UCT algorithm has been widely used in computer GO with significant improvements since its publication in 2006. However, the UCT algorithm does not address the horizon effects in game tree search, which is an important issue in computer games and it is typically addressed through quiescent search. This paper proposes a modification of the UCT algorithm such that quiescent search can be integrated in the UCT algorithm and proposes several conditions to trigger quiescent search in computer GO. Experimental results show that our modification can increase the game tree search depth significantly and improve its winning rate against GNUGO.