|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/14764
|
| タイトル: | Using Conspiracy Numbers for Improving Move Selectionin Minimax Game-Tree Search |
| 著者: | Vu, Quang
Ishitobi, Taichi
Terrillon, Jean-Christophe
Iida, Hiroyuki |
| キーワード: | Conspiracy Number
Evaluation Function
Move Selection
Minimax Search |
| 発行日: | 2016-2 |
| 出版者: | SCITEPRESS |
| 誌名: | Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016) |
| 巻: | 2 |
| 開始ページ: | 400 |
| 終了ページ: | 406 |
| DOI: | 10.5220/0005753004000406 |
| 抄録: | In a two-person perfect-information game, Conspiracy Number Search (CNS) was invented as a possible search algorithm but did not find much success. However, we believe that the conspiracy number, which is the core of CNS, has not been used to its full potential. In this paper, we propose a novel way to utilize the conspiracy number in the minimax framework. Instead of using conspiracy numbers separately, we combine them together. An example way of combining conspiracy numbers with the evaluation value is suggested. Empirical results obtained for the game of Othello show the potential of the proposed method. |
| Rights: | This material is posted here with permission of SCITEPRESS. Copyright (C) 2016 SCITEPRESS. Quang Vu, Taichi Ishitobi, Jean-Christophe Terrillon and Hiroyuki Iida, Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2, 2016, 400-406. http://dx.doi.org/10.5220/0005753004000406 |
| URI: | http://hdl.handle.net/10119/14764 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 22342.pdf | | 265Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
