|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10792
|
| タイトル: | Accelerated UCT and Its Application to Two-Player Games |
| 著者: | Hashimoto, Junichi
Kishimoto, Akihiro
Yoshizoe, Kazuki
Ikeda, Kokolo |
| 発行日: | 2012 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 7168 |
| 開始ページ: | 1 |
| 終了ページ: | 12 |
| DOI: | 10.1007/978-3-642-31866-5_1 |
| 抄録: | 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 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17304.pdf | | 175Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
