|
|
Chess Program with Various Chess Variations with Various Set of Figures
Škandera, František ; Žák, Jakub (referee) ; Rozman, Jaroslav (advisor)
The goal of this thesis was to create a chess program able to play various chess variations with various set of figures. The first part of the work deals with the general matters of creating a chess program and implementing a chess artificial intelligence. In the second part we analyze individual chosen chess variations and suggest strategies for their implementation. Eventually we describe the implementation of the created application itself and its structure.
|
|
|
Search of Metric State Space with Obstacles
Lukáč, Jakub ; Rozman, Jaroslav (referee) ; Šůstek, Martin (advisor)
This thesis is focused on search of metric state space with obstacles. The thesis selects four methods based on state space search and presents two new algorithms, which will try to consider an obstacles in metric space. The selected methods and the new designed algorithms are implemented as an application in programming language Java, application is also part of the thesis. The thesis presents experiments on metric spaces with various kind of obstacles for comparison of individual methods.
|
|
|
Chess Program with Various Chess Variations with Various Set of Figures
Škandera, František ; Žák, Jakub (referee) ; Rozman, Jaroslav (advisor)
The goal of this thesis was to create a chess program able to play various chess variations with various set of figures. The first part of the work deals with the general matters of creating a chess program and implementing a chess artificial intelligence. In the second part we analyze individual chosen chess variations and suggest strategies for their implementation. Eventually we describe the implementation of the created application itself and its structure.
|
|
|
Search of Metric State Space with Obstacles
Lukáč, Jakub ; Rozman, Jaroslav (referee) ; Šůstek, Martin (advisor)
This thesis is focused on search of metric state space with obstacles. The thesis selects four methods based on state space search and presents two new algorithms, which will try to consider an obstacles in metric space. The selected methods and the new designed algorithms are implemented as an application in programming language Java, application is also part of the thesis. The thesis presents experiments on metric spaces with various kind of obstacles for comparison of individual methods.
|
guest ::
