GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic

Viliam Lisý, Branislav Bošanský, Michal Jakob, Michal Pěchouček

Abstract

We present a novel approach to reducing adversarial search space by using background knowledge represented in the form of higher-level goals that players tend to pursue in the game. The algorithm is derived from a simultaneous-move modification of the maxn algorithm by only searching the branches of the game tree that are consistent with pursuing player’s goals. The algorithm has been tested on a real-world-based scenario modelled as a large-scale asymmetric game. The experimental results obtained indicate the ability of the goalbased heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies.

References

  1. Billings, D., Davidson, A., Schauenberg, T., Burch, N., Bowling, M., Holte, R. C., Schaeffer, J., and Szafron, D. (2004). Game-tree search with adaptation in stochastic imperfect-information games. In van den Herik, H. J., Bjrnsson, Y., and Netanyahu, N. S., editors, Computers and Games, volume 3846 of Lecture Notes in Computer Science, pages 21-34. Springer.
  2. Carmel, D. and Markovitch, S. (1996). Learning and using opponent models in adversary search. Technical Report CIS9609, Technion.
  3. Kovarsky, A. and Buro, M. (2005). Heuristic search applied to abstract combat games. In Canadian Conference on AI, pages 66-78.
  4. Luckhardt, C. and K.B.Irani (1986). An algorithmic solution of n-person games. In Proc. of the National Conference on Artificial Intelligence (AAAI-86), Philadelphia, Pa., August, pages 158-162.
  5. Mock, K. J. (2002). Hierarchical heuristic search techniques for empire-based games. In IC-AI, pages 643-648.
  6. Sailer, F., Buro, M., and Lanctot, M. (2007). Adversarial planning through strategy simulation. In IEEE Symposium on Computational Intelligence and Games (CIG), pages 80-87, Honolulu.
  7. Schaeffer, J. (1989). The history heuristic and alphabeta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11):1203-1212.
  8. Smith, S. J. J., Nau, D. S., and Throop, T. A. (1998). Computer bridge - a big win for AI planning. AI Magazine, 19(2):93-106.
  9. Stilman, B., Yakhnis, V., and Umanskiy, O. (2007). Adversarial Reasoning: Computational Approaches to Reading the Opponent's Mind, chapter 3.3. Strategies in Large Scale Problems, pages 251-285. Chapman & Hall/CRC.
  10. van Riemsdijk, M. B., Dastani, M., and Winikoff, M. (2008). Goals in agent systems: A unifying framework. In Padgham, Parkes, Mller, and Parsons, editors, Proc. of 7th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2008), volume Estoril, Portugal, pages 713-720.
  11. Willmott, S., Richardson, J., Bundy, A., and Levine, J. (2001). Applying adversarial planning techniques to Go. Theoretical Computer Science, 252(1-2):45-82.
Download


Paper Citation


in Harvard Style

Lisý V., Bošanský B., Jakob M. and Pěchouček M. (2009). GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8111-66-1, pages 53-60. DOI: 10.5220/0001659900530060


in Bibtex Style

@conference{icaart09,
author={Viliam Lisý and Branislav Bošanský and Michal Jakob and Michal Pěchouček},
title={GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2009},
pages={53-60},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001659900530060},
isbn={978-989-8111-66-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic
SN - 978-989-8111-66-1
AU - Lisý V.
AU - Bošanský B.
AU - Jakob M.
AU - Pěchouček M.
PY - 2009
SP - 53
EP - 60
DO - 10.5220/0001659900530060