|
|
Game Playing with Uncertainty
Bajza, Jakub ; Zbořil, František (referee) ; Zbořil, František (advisor)
This Bachelor thesis describes the implementation of expectiminimax algorithm for zero-sum games. It also introduces the complications, that you can face, if working on applying the expectiminimax algorithm to more complicated games of this category. This thesis also presents a way to create an evaluation function for computer opponent. The applicability of these evaluation functions is demonstrated by series of tests, where human player plays against computer opponent or two computer opponents play against each other.
|
|
|
Optimization of Processes in Logistics with Visualization Support
Kršák, Martin ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
The master thesis aims to design, implement, and compare algorithms that optimize processes in logistics, mainly in the planning phase. Heuristics and approximation genetic algorithms will find an near-optimal solution to NP-hard problem, such as the traveling salesman problem, with a delay less than several hours. The role of this algorithm is to plan an efficient route for garbage trucks that collect and distribute large-scale waste to waste yards in a specific city. The goal of the optimization is to minimize the shipping costs.
|
|
|
Optimization of Processes in Logistics with Visualization Support
Kršák, Martin ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
The master thesis aims to design, implement, and compare algorithms that optimize processes in logistics, mainly in the planning phase. Heuristics and approximation genetic algorithms will find an near-optimal solution to NP-hard problem, such as the traveling salesman problem, with a delay less than several hours. The role of this algorithm is to plan an efficient route for garbage trucks that collect and distribute large-scale waste to waste yards in a specific city. The goal of the optimization is to minimize the shipping costs.
|
|
|
Game Playing with Uncertainty
Bajza, Jakub ; Zbořil, František (referee) ; Zbořil, František (advisor)
This Bachelor thesis describes the implementation of expectiminimax algorithm for zero-sum games. It also introduces the complications, that you can face, if working on applying the expectiminimax algorithm to more complicated games of this category. This thesis also presents a way to create an evaluation function for computer opponent. The applicability of these evaluation functions is demonstrated by series of tests, where human player plays against computer opponent or two computer opponents play against each other.
|
guest ::
