Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search

Quang Vu, Taichi Ishitobi, Jean-Christophe Terrillon, Hiroyuki Iida

2016

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.

Paper Citation

in Harvard Style

Vu Q., Ishitobi T., Terrillon J. and Iida H. (2016). Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search . In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-172-4, pages 400-406. DOI: 10.5220/0005753004000406

in Bibtex Style

@conference{icaart16,
author={Quang Vu and Taichi Ishitobi and Jean-Christophe Terrillon and Hiroyuki Iida},
title={Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2016},
pages={400-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005753004000406},
isbn={978-989-758-172-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search
SN - 978-989-758-172-4
AU - Vu Q.
AU - Ishitobi T.
AU - Terrillon J.
AU - Iida H.
PY - 2016
SP - 400
EP - 406
DO - 10.5220/0005753004000406