Abstract
In recent years, Hexagonal chess has gradually appeared in various machine gaming competitions, and is popular among the public because of its simple and fair game rules. In this system, a computer game program is studied and designed with Hexagonal Chess as the object of study. In order to further improve the search speed of the algorithm, the UCT algorithm is used in this paper. This algorithm not only improves the search time of Monte Carlo tree algorithm, but also improves the performance of the algorithm in space.
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 callMore From: International Journal of Multidisciplinary Research and Analysis
Disclaimer: 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.
