Summary:
The object of this master thesis is the study of general game players. General
game players are able to play any game, if the game’s rules are represented in
a certain format – language. The development of the first general game players
began on 2000s, but the idea was born many years earlier, in an early version.
In this thesis, the basic architecture of a general game player, the
developments in recent years, and the difficulties found are presented. In
order for the study to be more accurate, the SweetGGP general game player was
developed, in order to use the knowledge gained, as much as possible, and come
to conclusions. Finally, extensions of the game description language were
developed, so that the description of some groups of games becomes easier.
Keywords:
General game players, Search, Rivalry, Game representation, Heuristics
