Abstract
We present a novel approach to reducing adversarial search space by employing 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 max n algorithm by limiting the search to those 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 goal-based heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Luckhardt, C., Irani, K.B.: An algorithmic solution of n-person games. In: Proc. of the National Conference on Artificial Intelligence (AAAI 1986), Philadelphia, Pa, August 1986, pp. 158–162 (1986)
Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(11), 1203–1212 (1989)
Sailer, F., Buro, M., Lanctot, M.: Adversarial planning through strategy simulation. In: IEEE Symposium on Computational Intelligence and Games (CIG), Honolulu, pp. 80–87 (2007)
Kovarsky, A., Buro, M.: Heuristic search applied to abstract combat games. In: Canadian Conference on AI, pp. 66–78 (2005)
van Riemsdijk, M.B., Dastani, M., Winikoff, M.: Goals in agent systems: A unifying framework. In: Padgham, Parkes, Müller, Parsons (eds.) Proc. of 7th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 2008, pp. 713–720 (2008)
Carmel, D., Markovitch, S.: Learning and using opponent models in adversary search. Technical Report CIS9609, Technion (1996)
Semsch, E., Lisý, V., Bošanský, B., Jakob, M., Pavlíček, D., Doubek, J., Pechoucek, M.: Adversarial behavior testbed. Technical Report GLR 90/09, CTU, FEE, Gerstner Lab (2009), http://agents.felk.cvut.cz/publications
Billings, D., Davidson, A., Schauenberg, T., Burch, N., Bowling, M., Holte, R.C., Schaeffer, J., Szafron, D.: Game-tree search with adaptation in stochastic imperfect-information games. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 21–34. Springer, Heidelberg (2006)
Smith, S.J.J., Nau, D.S., Throop, T.A.: Computer bridge - a big win for AI planning. AI Magazine 19(2), 93–106 (1998)
Willmott, S., Richardson, J., Bundy, A., Levine, J.: Applying adversarial planning techniques to Go. Theoretical Computer Science 252(1-2), 45–82 (2001)
Mock, K.J.: Hierarchical heuristic search techniques for empire-based games. In: ICAI, pp. 643–648 (2002)
Stilman, B., Yakhnis, V., Umanskiy, O.: 3.3. Strategies in Large Scale Problems. In: Adversarial Reasoning: Computational Approaches to Reading the Opponent’s Mind, pp. 251–285. Chapman & Hall/CRC, Boca Raton (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisý, V., Bošanský, B., Jakob, M., Pěchouček, M. (2010). Goal-Based Game Tree Search for Complex Domains. In: Filipe, J., Fred, A., Sharp, B. (eds) Agents and Artificial Intelligence. ICAART 2009. Communications in Computer and Information Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11819-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-11819-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11818-0
Online ISBN: 978-3-642-11819-7
eBook Packages: Computer ScienceComputer Science (R0)