Abstract
We present a general approach for the decomposition of games described in the Game Description Language (GDL). In the field of General Game Playing, the exploration of games described in GDL can be significantly sped up by the decomposition of the problem in sub-problems analyzed separately. Our program can decompose game descriptions with any number of players while addressing the problem of joint moves. This approach is used to identify perfectly separable sub-games but can also decompose serial games composed of two subgames and games with compound moves while avoiding, unlike previous works, to rely on syntactic elements that can be eliminated by simply rewriting the GDL rules. We tested our program on 40 games, compound or not, and we can decompose 32 of them successfully in less than 5 s.
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
Notes
- 1.
The * represents different possible values, the whole meta-action set contains 12 compound moves.
References
Cerexhe, T., Rajaratnam, D., Saffidine, A., Thielscher, M.: A systematic solution to the (de-)composition problem in general game playing. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 195–200. IOS Press (2014)
Cox, E., Schkufza, E., Madsen, R., Genesereth, M.: Factoring general games using propositional automata. In: Proceedings of the IJCAI-09 Workshop on General Game Playing (GIGA 2009), pp. 13–20 (2009)
Genesereth, M., Björnsson, Y.: The international general game playing competition. AI Mag. 34(2), 107–111 (2013)
Genesereth, M.R., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62–72 (2005)
Günther, M.: Decomposition of Single Player Games. Master’s thesis, TU-Dresden, Germany (2007)
Günther, M., Schiffel, S., Thielscher, M.: Factoring general games. In: Proceedings of the IJCAI-09 Workshop on General Game Playing (GIGA 2009), pp. 27–33 (2009)
Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General Game Playing: Game Description Language Specification. Technical report LG-2006-01, Stanford University, March 2008
Schkufza, E., Love, N., Genesereth, M.: Propositional automata and cell automata: representational frameworks for discrete dynamic systems. In: Wobcke, W., Zhang, M. (eds.) AI 2008. LNCS (LNAI), vol. 5360, pp. 56–66. Springer, Heidelberg (2008). doi:10.1007/978-3-540-89378-3_6
Vittaut, J., Méhat, J.: Fast instantiation of GGP game descriptions using prolog with tabling. In: ECAI 2014, pp. 1121–1122 (2014)
Zhao, D.: Decomposition of Multi-Player Games. Master’s thesis, TU-Dresden, Germany (2009)
Zhao, D., Schiffel, S., Thielscher, M.: Decomposition of multi-player games. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS (LNAI), vol. 5866, pp. 475–484. Springer, Heidelberg (2009). doi:10.1007/978-3-642-10439-8_48
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hufschmitt, A., Vittaut, JN., Méhat, J. (2017). A General Approach of Game Description Decomposition for General Game Playing. In: Cazenave, T., Winands, M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds) Computer Games. CGW GIGA 2016 2016. Communications in Computer and Information Science, vol 705. Springer, Cham. https://doi.org/10.1007/978-3-319-57969-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-57969-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57968-9
Online ISBN: 978-3-319-57969-6
eBook Packages: Computer ScienceComputer Science (R0)