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

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

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.

References

  1. Allis, V., van der Meulen, M., and van den Herik, J. (1994). Proof-number search. Artificial Intelligence , 66(1):91 - 124.
  2. Anantharaman, T., Campbell, M. S., and Hsu, F.-h. (1990). Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence , 43(1):99-109.
  3. Beal, D. F. (1990). A generalised quiescence search algorithm. Artificial Intelligence , 43(1):85-98.
  4. Elkan, C. (1989). Conspiracy numbers and caching for searching and/or trees and theorem-proving. In IJCAI, pages 341-348.
  5. Goetsch, G. and Campbell, M. S. (1990). Experiments with the null-move heuristic. In Computers, Chess, and Cognition, pages 159-168. Springer.
  6. Khalid, M. N. A., Yusof, U. K., Iida, H., and Ishitobi, T. (2015). Critical position identification in games and its application to speculative play. In International Conference on Agents and Artificial Intelligence (ICAART-2015).
  7. Kishimoto, A., Winands, M. H., M üller, M., and Saito, J.-T. (2012). Game-tree search using proof numbers: The first twenty years. ICGA Journal, 35(3):131-156.
  8. Klingbeil, N. and Schaeffer, J. (1990). Empirical results with conspiracy numbers. Computational Intelligence, 6(1):1-11.
  9. Knuth, D. E. and Moore, R. W. (1975). An analysis of alpha-beta pruning. Artificial intelligence , 6(4):293- 326.
  10. Lister, L. and Schaeffer, J. (1994). An analysis of the conspiracy numbers algorithm. Computers & Mathematics with Applications, 27(1):41 - 64.
  11. McAllester, D. A. (1988). Conspiracy numbers for min-max search. Artificial Intelligence , 35(3):287 - 310.
  12. McAllester, D. A. and Yuret, D. (2002). Alpha-betaconspiracy search. ICGA Journal, 25(1):16 - 35.
  13. Schaeffer, J. (1990). Conspiracy numbers. Artificial Intelligence, 43(1):67 - 84.
  14. Schaeffer, J., Burch, N., Bj örnsson, Y., Kishimoto, A., M üller, M., Lake, R., Lu, P., and Sutphen, S. (2007). Checkers is solved. science, 317(5844):1518-1522.
  15. Seo, M., Iida, H., and Uiterwijk, J. W. (2001). The PN*- search algorithm: Application to tsume-shogi. Artificial Intelligence, 129(1):253-277.
  16. Shannon, C. (1950). Programming a computer for playing chess. Philosophical Magazine, 41(314):256 - 275.
  17. Stockman, G. C. (1979). A minimax algorithm better than alpha-beta? Artificial Intelligence , 12(2):179-196.
  18. Turing, A. M., Bates, M., Bowden, B., and Strachey, C. (1953). Digital computers applied to games. Faster than thought, 101.
  19. United States Othello Association (2015). 2015 national open transcripts.
Download


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