JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/10792

Title: Accelerated UCT and Its Application to Two-Player Games
Authors: Hashimoto, Junichi
Kishimoto, Akihiro
Yoshizoe, Kazuki
Ikeda, Kokolo
Issue Date: 2012
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 7168
Start page: 1
End page: 12
DOI: 10.1007/978-3-642-31866-5_1
Abstract: Monte-Carlo Tree Search (MCTS) is a very successful approach for improving the performance of game-playing programs. This paper presents the Accelerated UCT algorithm, which overcomes a weakness of MCTS caused by deceptive structures which often appear in game tree search. It consists in using a new backup operator that assigns higher weights to recently visited actions, and lower weights to actions that have not been visited for a long time. Results in Othello, Havannah and Go show that Accelerated UCT is not only more effective than previous approaches but also improves the strength of FUEGO, which is one of the best computer Go programs.
Rights: This is the author-created version of Springer, Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda, Lecture Notes in Computer Science, 7168, 2012, 1-12. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-31866-5_1
URI: http://hdl.handle.net/10119/10792
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
17304.pdf175KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology