Critical Position Identification in Games and Its Application to Speculative Play

Mohd Nor Akmal Khalid, Umi Kalsom Yusof, Hiroyuki Iida, Taichi Ishitobi

Abstract

Research in two-player perfect information games have been one of the focus of computer-game related studies in the domain of artificial intelligence. However, focus on an effective search program is insufficient to give the “taste” of actual entertainment in the gaming industry. Instead of focusing on effective search algorithm, we dedicate our study in realizing the possibility of applying speculative play. However, quantifying and determining this possibility is the main challenge imposed in this study. For this purpose, the Conspiracy Number Search algorithm is considered where the maximum and minimum conspiracy numbers are recorded in the test bed of a simple Tic-Tac-Toe game application. We analyze these numbers as the measures of critical position identifier which determines the right moment for possibility of applying speculative play through operators formally defined in this article as ↑ tactic and ↓ tactic. Interesting results are obtained with convincing evidences but further works are still needed in order to prove our hypothesis.

References

  1. Allis, L. V., van der Meulen, M., and Van Den Herik, H. J. (1994). Proof-number search. Artificial Intelligence, 66(1):91-124.
  2. Buro, M. (1999). From simple features to sophisticated evaluation functions. In Computers and Games, pages 126-145. LNCS 1558, Springer.
  3. Carmel, D. and Markovitch, S. (1993). Learning models of opponent's strategy in game playing. TechnionIsrael Institute of Technology, Center for Intelligent Systems.
  4. Donkers, J. (2003). Nosce Hostem: Searching with Opponent Models. PhD thesis, Universiteit Maastricht.
  5. Elkan, C. (1989). Conspiracy numbers and caching for searching and/or trees and theorem-proving. In IJCAI, pages 341-348.
  6. Iida, H., Uiterwijk, J., Herik, H. J. v. d., and Herschberg, I. (1993). Potential applications of opponent-model search: Part 1. the domain of applicability. ICCA Journal, 16(4):201-208.
  7. Iida, H., Uiterwijk, J., Herik, H. J. v. d., and Herschberg, I. (1994). Potential applications of opponent-model search. part 2: risks and strategies. ICCA Journal, 17(1):10-14.
  8. Ishitobi, T., Cincotti, A., and Iida, H. (2013). Shapekeeping technique and its application to checkmate problem composition. In Ninth Artificial Intelligence and Interactive Digital Entertainment Conference.
  9. Jansen, P. (1992). Using knowledge about the opponent in game-tree search. PhD thesis, Carnegie Mellon University.
  10. 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, (3).
  11. Lorenz, U., Rottmann, V., Feldmann, R., and Mysliwietz, P. (1995). Controlled conspiracy number search. ICCA Journal, 18(3):135-147.
  12. McAllester, D. A. (1985). A new procedure for growing min-max trees. Technical report, Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA.
  13. McAllester, D. A. (1988). Conspiracy numbers for min-max search. Artificial Intelligence, 35(3):287-310.
  14. McAllester, D. A. and Yuret, D. (1993). conspiracy search.
  15. Neumann, L. J. and Morgenstern, O. (1947). Theory of games and economic behavior, volume 60. Princeton university press Princeton, NJ.
  16. Ramon, J., Jacobs, N., and Blockeel, H. (2002). Opponent modeling by analysing play. In Proceedings of Workshop on agents in computer games. Citeseer.
  17. Schaeffer, J. (1989). Conspiracy numbers. Advances in Computer Chess, 5:199-218.
  18. Schaeffer, J. (1990). Conspiracy numbers. Artificial Intelligence, 43(1):67-84.
  19. Schaeffer, J. and van den Herikb, J. (2002). Games, computers, and artificial intelligence. Chips Challenging Champions: Games, Computers and Artificial Intelligence, 3.
  20. Shannon, C. E. (1950). Xxii. programming a computer for playing chess. Philosophical magazine, 41(314):256- 275.
  21. van den Herik, H. J., Donkers, H., and Spronck, P. H. (2005). Opponent modelling and commercial games. In Proceedings of the IEEE 2005 Symposium on Computational Intelligence and Games (CIG05), pages 15-25.
  22. van der Meulen, M. (1990). Conspiracy-number search. ICCA Journal., 13(1):3-14.
Download


Paper Citation


in Harvard Style

Khalid M., Yusof U., Iida H. and Ishitobi T. (2015). Critical Position Identification in Games and Its Application to Speculative Play . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-074-1, pages 38-45. DOI: 10.5220/0005179900380045


in Bibtex Style

@conference{icaart15,
author={Mohd Nor Akmal Khalid and Umi Kalsom Yusof and Hiroyuki Iida and Taichi Ishitobi},
title={Critical Position Identification in Games and Its Application to Speculative Play},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2015},
pages={38-45},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005179900380045},
isbn={978-989-758-074-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Critical Position Identification in Games and Its Application to Speculative Play
SN - 978-989-758-074-1
AU - Khalid M.
AU - Yusof U.
AU - Iida H.
AU - Ishitobi T.
PY - 2015
SP - 38
EP - 45
DO - 10.5220/0005179900380045