The goal of General Game Playing (GGP) is to develop a system, that is able to automatically play previously unseen games well, solely by being given the rules of the game.
In contrast to traditional game playing programs, a general game player cannot be given game specific knowledge.
Instead, the program has to discover this knowledge and use it for effectively playing the game well without human intervention.
In this thesis, we present a such a program and general methods that solve a variety of knowledge discovery problems in GGP.
Our main contributions are methods for the automatic construction of heuristic evaluation functions, the automated discovery of game structures, a system for proving properties of games, and symmetry detection and exploitation for general games.:1. Introduction
2. Preliminaries
3. Components of Fluxplayer
4. Game Tree Search
5. Generating State Evaluation Functions
6. Distance Estimates for Fluents and States
7. Proving Properties of Games
8. Symmetry Detection
9. Related Work
10. Discussion
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:26030 |
| Date | 29 July 2011 |
| Creators | Schiffel, Stephan |
| Contributors | Thielscher, Michael, Björnsson, Yngvi, Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis, info:eu-repo/semantics/doctoralThesis, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0017 seconds