Paritní hry: struktura, algoritmy, experimenty

Abstract

The thesis deals with the issue of parity games. In the first part of the work we focus on explaining and defining parity games and all of the terms associated with it. It is mainly about what parity games are and how are they played. Right after follows description of the important structures, such as a graph, on which they are set and terms used in solving algorithms. The main part of the thesis is explaining specific algorithms dealing with parity games. These are described and defined, including examples of how each algorithm works. This is followed by a description of the application resulting in this work. The application uses the specified algorithms for solving parity games in intuitive user interface with options for testing them. The last part deals with testing of the algorithms and comparing the results of algorithms.

Description

Subject(s)

Parity games, Recursive algorithm, Small dominion finder, Small progres measures, Strategy Improvement, C#, PGSolver

Citation