Abstract
General Game Playing (GGP) programs need a Game Description Language (GDL) reasoner to be able to interpret the game rules and search for the best actions to play in the game. One method for interpreting the game rules consists of translating the GDL game description into an alternative representation that the player can use to reason more efficiently on the game. The Propositional Network (PropNet) is an example of such method. The use of PropNets in GGP has become popular due to the fact that PropNets can speed up the reasoning process by several orders of magnitude compared to custom-made or Prolog-based GDL reasoners, improving the quality of the search for the best actions. This paper analyzes the performance of a PropNet-based reasoner and evaluates four different optimizations for the PropNet structure that can help further increase its reasoning speed in terms of visited game states per second.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We have used a more recent and improved version than the one tested in [7].
- 2.
The GDL descriptions used for the experiments were downloaded from the repository on 03/02/2016.
References
Björnsson, Y., Finnsson, H.: CadiaPlayer: a simulation-based general game player. IEEE Trans. Comput. Intell. AI Games 1(1), 4–15 (2009)
Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M. (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75538-8_7
Cox, E., Schkufza, E., Madsen, R., Genesereth, M.R.: Factoring general games using propositional automata. In: Björnsson, Y., Stone, P., Thielscher, M. (eds.) Proceedings of the IJCAI Workshop on General Intelligence in Game-Playing Agents (GIGA), pp. 13–20 (2009)
Draper, S., Rose, A.: Sancho GGP player (2014). http://sanchoggp.blogspot.nl/2014/07/sancho-is-ggp-champion-2014.html
Emslie, R.: Galvanise (2015). https://github.com/richemslie/galvanise
Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.R.: General game playing: game description language specification. Technical report, Stanford University, Stanford, CA, USA (2008)
Schiffel, S., Björnsson, Y.: Efficiency of GDL reasoners. IEEE Trans. Comput. Intell. AI Games 6(4), 343–354 (2014)
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
Schreiber, S.: The general game playing base package (2013). https://github.com/ggp-org/ggp-base
Schreiber, S.: Games - base repository (2016). http://games.ggp.org/base/
Sturtevant, N.R.: An analysis of UCT in multi-player games. ICGA J. 31(4), 195–208 (2008)
Acknowledgments
This work is funded by the Netherlands Organisation for Scientific Research (NWO) in the framework of the project GoGeneral, grant number 612.001.121.
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
Sironi, C.F., Winands, M.H.M. (2017). Optimizing Propositional Networks. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-57969-6_10
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)