UCT based search in phantom go

Phantom Go is a kind of imperfect information two-player game. It combines the large searching space in Go and the uncertainty of imperfect information games. Monte Carlo methods and UCT algorithm were suggested applying in Phantom Go and got certain effect. When applying Monte Carlo methods in Phantom Go, guessing opponent stones is the first step. In this paper, we discussed some special situations in Phantom Go to infer some of opponent´s stones based on the current information and gave a method for guessing opponent stones. Then we applied UCT search using previous simulation results in Phantom Go and compared it with Monte Carlo Tree Search.