By Topic

A persistent game graph in computer GO

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing Huang ; BUPT-JD Res. Inst. of Comput. GO, Beijing Univ. of Posts & Telecommun., Beijing, China ; Zhiqing Liu

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 efficiently, and presents a modification 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.

Published in:

Control and Decision Conference (CCDC), 2011 Chinese

Date of Conference:

23-25 May 2011