JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >

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

Title: Using Conspiracy Numbers for Improving Move Selectionin Minimax Game-Tree Search
Authors: Vu, Quang
Ishitobi, Taichi
Terrillon, Jean-Christophe
Iida, Hiroyuki
Keywords: Conspiracy Number
Evaluation Function
Move Selection
Minimax Search
Issue Date: 2016-2
Magazine name: Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016)
Volume: 2
Start page: 400
End page: 406
DOI: 10.5220/0005753004000406
Abstract: 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
Material Type: publisher
Appears in Collections:b11-1. 会議発表論文・発表資料 (Conference Papers)

Files in This Item:

File Description SizeFormat
22342.pdf265KbAdobe 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