Abstract
The UCT algorithm has been widely used in computer GO with significant improvements since its publication in 2006. However, the UCT algorithm does not address the horizon effects in game tree search, which is an important issue in computer games and it is typically addressed through quiescent search. This paper proposes a modification of the UCT algorithm such that quiescent search can be integrated in the UCT algorithm and proposes several conditions to trigger quiescent search in computer GO. Experimental results show that our modification can increase the game tree search depth significantly and improve its winning rate against GNUGO.
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.
