Skip to main content
SpringerLink
Log in

Lifted Backward Search for General Game Playing

  • Conference paper
  • First Online:
AI 2016: Advances in Artificial Intelligence (AI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9992))

Included in the following conference series:

Abstract

A General Game player is a computer program that can play games of which the rules are only known at run-time. These rules are usually given as a logic program. General Game players commonly apply a tree search over the state space, which is time consuming. In this paper we therefore present a new method that allows a player to detect that a future state satisfies some beneficial properties, without having to explicitly generate that state in the search tree. This may lead to faster algorithms and hence to better performance. Our method employs a search algorithm that searches backwards through formula space rather than state space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Notes

  1. 1.

    http://sanchoggp.blogspot.co.uk/2014/05/what-is-sancho.html.

  2. 2.

    https://bitbucket.org/rxe/galvanise_v2.

  3. 3.

    http://www.ggp.org/view/tiltyard/games/.

  4. 4.

    The universal quantifier \(\forall \) is not included in the language.

  5. 5.

    GDL defines more relations, but these are not relevant for this paper.

  6. 6.

    The implication \(\rightarrow \) is not allowed in a complex formula.

References

  1. Alcázar, V., Borrajo, D., Fernández, S., Fuentetaja, R.: Revisiting regression in planning. In: IJCAI 2013, Beijing, China, 3–9 August 2013 (2013)

    Google Scholar 

  2. Bonet, B., Geffner, H.: Planning as heuristic search. Artif. Intell. 129(1–2), 5–33 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE Trans. Knowl. Data Eng. 1(1), 146–166 (1989)

    Article  Google Scholar 

  4. Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40–110. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03754-2_2

    Chapter  Google Scholar 

  5. Finnsson, H.: Simulation-based general game playing. Ph.D. thesis, School of Computer Science, Reykjavik University (2012)

    Google Scholar 

  6. Genesereth, M., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62–72 (2005)

    Google Scholar 

  7. Genesereth, M.R., Thielscher, M.: General Game Playing. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2014)

    Book  MATH  Google Scholar 

  8. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)

    MATH  Google Scholar 

  9. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif‘. Intell. 6(4), 293–326 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006). doi:10.1007/11871842_29

    Chapter  Google Scholar 

  11. Love, N., Genesereth, M., Hinrichs, T.: General game playing: game description language specification. Technical report. LG-2006-01, Stanford University, Stanford, CA (2006)

    Google Scholar 

  12. von Neumann, J.: On the theory of games of strategy. In: Tucker, A., Luce, R. (eds.) Contributions to the Theory of Games, pp. 13–42. Princeton University Press, New Jersey (1959)

    Google Scholar 

  13. Schiffel, S., Thielscher, M.: M.: Fluxplayer: a successful general game player. In: Proceedings of AAAI 2007, pp. 1191–1196. AAAI Press (2007)

    Google Scholar 

  14. Trutman, M., Schiffel, S.: Creating action heuristics for general game playing agents. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW/GIGA -2015. CCIS, vol. 614, pp. 149–164. Springer, Heidelberg (2016). doi:10.1007/978-3-319-39402-2_11

    Chapter  Google Scholar 

  15. Zhang, D., Thielscher, M.: A logic for reasoning about game strategies. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15), pp. 1671–1677 (2015)

    Google Scholar 

Download references

Acknowledgments

This work was sponsored by an Endeavour Research Fellowship awarded by the Australian Government Department of Education.

Author information

Authors and Affiliations

  1. Western Sydney University, Werrington, Australia

    Dave de Jonge & Dongmo Zhang

Authors
  1. Dave de Jonge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongmo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dave de Jonge .

Editor information

Editors and Affiliations

  1. University of Tasmania, Hobart, Australia

    Byeong Ho Kang

  2. Auckland University of Technology, Auckland, New Zealand

    Quan Bai

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

de Jonge, D., Zhang, D. (2016). Lifted Backward Search for General Game Playing. In: Kang, B.H., Bai, Q. (eds) AI 2016: Advances in Artificial Intelligence. AI 2016. Lecture Notes in Computer Science(), vol 9992. Springer, Cham. https://doi.org/10.1007/978-3-319-50127-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50127-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50126-0

  • Online ISBN: 978-3-319-50127-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation