Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
