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.
Phantom Go Imperfect Information Games. UCT Monte-Carlo Tree Search
Shiquan Shen Jie Xu Hongye Li Tan Zhu Jiao Wang
Dalian Measuring and Control Technique Research Institute. Dalian College of Information Science and Engineering Northeastern University, Shenyang 110819
国际会议
the 25th Chinese Control and Decision Conference(第25届中国控制与决策会议)
贵阳
英文
1665-1670
2013-05-01(万方平台首次上网日期,不代表论文的发表时间)