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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:14-qucosa-88742 |
| Date | 14 June 2012 |
| Creators | Schiffel, Stephan |
| Contributors | Technische Universität Dresden, Fakultät Informatik, Prof. Michael Thielscher, Prof. Yngvi Björnsson |
| Publisher | Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis |
| Format | application/pdf |
Page generated in 0.0021 seconds