|
|
Sokoban game and artificial intelligence
Žlebek, Petr ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
The thesis is focused on solving the Sokoban game using artificial intelligence algorithms. The first part of the thesis describes the Sokoban game, state space and selected state space search methods. In the second part selected methods were implemented and graphic user interface was created in the Python environment. Comparative experiments were executed in the final part.
|
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
|
|
Grid-Based Path Planning
Novella, Tomáš ; Balyo, Tomáš (advisor) ; Martínek, Vladislav (referee)
This thesis deals with effective ways of pathfinding in grid-based graphs. In the first part we pointed out the most important approaches to finding the shortest path. In the second part we proposed an algorithm that improves the speed of pathfinding in some special cases of grid-based graph. In the end we proved it by providing a series of experiments. Powered by TCPDF (www.tcpdf.org)
|
|
|
Sokoban game and artificial intelligence
Žlebek, Petr ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
The thesis is focused on solving the Sokoban game using artificial intelligence algorithms. The first part of the thesis describes the Sokoban game, state space and selected state space search methods. In the second part selected methods were implemented and graphic user interface was created in the Python environment. Comparative experiments were executed in the final part.
|
|
|
Grid-Based Path Planning
Novella, Tomáš ; Balyo, Tomáš (advisor) ; Martínek, Vladislav (referee)
This thesis deals with effective ways of pathfinding in grid-based graphs. In the first part we pointed out the most important approaches to finding the shortest path. In the second part we proposed an algorithm that improves the speed of pathfinding in some special cases of grid-based graph. In the end we proved it by providing a series of experiments. Powered by TCPDF (www.tcpdf.org)
|
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
guest ::
