Skip to main content

Multigame Playing by Means of UCT Enhanced with Automatically Generated Evaluation Functions

  • Conference paper

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

Abstract

General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose and validate a new modification of UCT game-tree analysis algorithm working in cooperation with a knowledge-free method of building approximate evaluation functions for GGP games. The process of function development consists of two, autonomously performed, stages: generalization and specification.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2/3), 235–256 (2002)

    Article  MATH  Google Scholar 

  2. Clune, J.: Heuristic evaluation functions for General Game Playing. In: Proceed- ings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI 2007), Vancouver, BC, Canada, pp. 1134–1139. AAAI Press, Menlo Park (2007)

    Google Scholar 

  3. Finnsson, H., Björnsson, Y.: Simulation-based approach to General Game Playing. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), Chicago, IL, pp. 259–264. AAAI Press, Menlo Park (2008)

    Google Scholar 

  4. Gelly, S., Wang, Y.: Exploration exploitation in Go: UCT for Monte-Carlo Go. In: Neural Information Processsing Systems 2006 Workshop on On-line Trading of Exploration and Exploitation (2006)

    Google Scholar 

  5. Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns on Monte Carlo Go. Technical Report 6062, INRIA (2006)

    Google Scholar 

  6. General Game Playing website by Stanford University, http://games.stanford.edu/

  7. General Game Playing website by Dresden University of Technology, http://www.general-game-playing.de/

  8. Genesereth, M., Love, N.: General Game Playing: Overview of the AAAI Competition (2005), http://games.stanford.edu/competition/misc/aaai.pdf

  9. Kaiser, D.: The Design and Implementation of a Successful General Game Playing Agent. In: Proceedings of FLAIRS Conference, pp. 110–115 (2007)

    Google Scholar 

  10. Kuhlmann, G., Dresner, K., Stone, P.: Automatic heuristic construction in a complete General Game Player. In: Proceedings of the Twenty-First AAAI Conference on Artificial Intelligence (AAAI 2006), Boston, MA, pp. 1457–1462. AAAI Press, Menlo Park (2006)

    Google Scholar 

  11. Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General Game Playing: Game Description Language Specification (2008), http://games.stanford.edu/language/spec/gdl_spec_2008_03.pdf

  12. Mańdziuk, J.: Knowledge-Free and Learning-Based Methods in Intelligenet Game Playing. Studies in Computational Intelligence, vol. 276. Springer, Heidelberg (2010)

    Book  Google Scholar 

  13. Mańdziuk, J., Kusiak, M., Walędzik, K.: Evolutionary-based heuristic generators for checkers and give-away checkers. Expert Systems 24(4), 189–211 (2007)

    Article  Google Scholar 

  14. Reisinger, J., Bahc̨eci, E., Karpov, I., Miikkulainen, R.: Coevolving strategies for general game playing. In: Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG 2007), Honolulu, Hawaii, pp. 320–327. IEEE Press, Los Alamitos (2007)

    Chapter  Google Scholar 

  15. Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317, 1518–1522 (2007)

    Article  MathSciNet  Google Scholar 

  16. Schiffel, S., Thielscher, M.: Automatic Construction of a Heuristic Search Function for General Game Playing. In: Seventh IJCAI International Workshop on Non-monotonic Reasoning, Action and Change (NRAC 2007) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walędzik, K., Mańdziuk, J. (2011). Multigame Playing by Means of UCT Enhanced with Automatically Generated Evaluation Functions. In: Schmidhuber, J., Thórisson, K.R., Looks, M. (eds) Artificial General Intelligence. AGI 2011. Lecture Notes in Computer Science(), vol 6830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22887-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22887-2_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22886-5

  • Online ISBN: 978-3-642-22887-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics