A Persistent Game Graph in Computer GO
Internal states in a computer GO program are typically organized as a game tree. While simple and convenient, the game tree organization may result in more tree nodes than actual internal states because duplicated tree nodes exist to represent the same gaming state. Modern computer GO programs use the UCT algorithm to conduct game tree search. Duplicated nodes in the game tree representation would make the UCT algorithm less effective. This paper proposes an approach to represent gaming internal states as a directed graph ef.ciently, and presents a modi.cation of the UCT algorithm to work on the directed graph representation. Furthermore, this paper describes an approach to make the directed game graph persistent so that historical data can be reused to improve the accuracy of the UCT algorithm.
UCT algorithm Game Tree Graph State
Jing Huang Zhiqing Liu
BUPT-JD Research Institute of Computer GO School of Software Engineering Beijing University of Posts and Telecommunications Beijing, China 100876
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
2523-2526
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）