KI - Künstliche Intelligenz

, Volume 25, Issue 1, pp 49–52 | Cite as

Gamer, a General Game Playing Agent

  • Peter KissmannEmail author
  • Stefan Edelkamp


This work is concerned with our general game playing agent Gamer. In contrast to many other players, we do not only use a Prolog-like mechanism to infer knowledge about the current state and the available moves but instantiate the games to reduce the inference time in parallel UCT game tree search. Furthermore, we use the generated output to try to solve the games using symbolic search methods and thus play optimally.


General game playing Instantiating games Solving games Symbolic search UCT 


  1. 1.
    Bryant RE (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput 35(8):677–691 zbMATHCrossRefGoogle Scholar
  2. 2.
    Cazenave T, Jouandeau N (2007) On the parallelization of UCT. In: Computer games workshop (CGW), pp 93–101 Google Scholar
  3. 3.
    Clune J (2007) Heuristic evaluation functions for general game playing. In: Holte RC, Howe A (eds) AAAI. AAAI Press, Menlo Park, pp 1134–1139 Google Scholar
  4. 4.
    Edelkamp S, Kissmann P, Sulewski D, Messerschmidt H (2010) Finding the needle in the haystack with heuristically guided swarm tree search. In: Schumann M, Kolbe LM, Breitner MH, Frerichs A (eds) Multikonferenz Wirtschaftsinformatik – 24th PuK Workshop. Universitätsverlag Göttingen, Göttingen, pp 2295–2308 Google Scholar
  5. 5.
    Finnsson H, Björnsson Y (2008) Simulation-based approach to general game playing. In: Fox D, Gomes CP (eds) AAAI. AAAI Press, Menlo Park, pp 259–264 Google Scholar
  6. 6.
    Kissmann P, Edelkamp S (2010a) Instantiating general games using Prolog or dependency graphs. In: Dillmann R, Beyerer J, Schultz T, Hanebeck UD (eds) KI. Lecture notes in artificial intelligence (LNAI), vol 6359. Springer, Berlin, pp 255–262 Google Scholar
  7. 7.
    Kissmann P, Edelkamp S (2010b) Layer-abstraction for symbolically solving general two-player games. In: Felner A, Sturtevant N (eds) SoCS. AAAI Press, Menlo Park, pp 63–70 Google Scholar
  8. 8.
    Kocsis L, Szepesvári C (2006) Bandit based Monte-Carlo planning. In: Fürnkranz J, Scheffer T, Spiliopoulou M (eds) ECML. Lecture notes in computer science (LNCS), vol 4212. Springer, Berlin, pp 282–293 Google Scholar
  9. 9.
    Love NC, Hinrichs TL, Genesereth MR (2006) General game playing: game description language specification. Tech Rep LG-2006-01, Stanford Logic Group Google Scholar
  10. 10.
    Méhat J, Cazenave T (2010) Ary, a general game playing program. In: 13th board game studies colloquium Google Scholar
  11. 11.
    Schiffel S, Thielscher M (2007) Fluxplayer: a successful general game player. In: Holte RC, Howe A (eds) AAAI. AAAI Press, Menlo Park, pp 1191–1196 Google Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Technologie-Zentrum Informatik und Informationstechnik (TZI)Universität BremenBremenGermany

Personalised recommendations