|
|
Program for Automatic Playing of Solitaire and Mines
Mores, Martin ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This thesis focuses on the design and implementation of two programs for automatic game play, Mine Search and Solitaire. The theoretical part focuses on the rules about the games and what regularities follow from them, and on the state space search theory. The work in the following chapters describes the implementation of the two programs and describes various things that led to the eventual speedup of the times compared to past work. The thesis also provides the reader with various techniques that can be used in their own implementation. And at the end of the thesis, an evaluation of the implementation is summarized and potential improvements are suggested.
|
|
|
Graph theory - implementation of selected problems
Stráník, František ; Rajmic, Pavel (referee) ; Koutný, Martin (advisor)
This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.
|
|
|
Demonstration of Graph Algorithms
Varadinek, Jakub ; Zámečníková, Eva (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with the development of the application for demonstration and visualization of several graph algorithms. The application allows the user to create a graph, rate edges or name and layout vertices. The individual algorithms can be performed in created graph for visual observation how the algorithm works. There is also the possibility of stepping through the chosen algorithm and an interactive mode where next steps are selected by the user and the application checks the correctness of these steps.
|
|
| |
|
|
Griddlers Solver
Balcárek, Lukáš ; Čermák, Martin (referee) ; Goldefus, Filip (advisor)
The basic motive of this work is the logical game Griddlers. There are shown the various techniques for finding the right solution. To find solutions to the assignment are used uninformed and informed algorithms which are optimized for this logical game. Part of this work is also created console application demonstrating the search of the results from the given metadata. It is possible to test various specifications and observe the changing computing demands on them. This created application is designed to easily show the interconnection of artificial intelligence, algorithms and data processing in the selected game Griddlers.
|
|
|
Analysis of Data Flow in the Fly-by-Wire System
Kubínová, Zuzana ; Tomáš, Jan (referee) ; Matoušek, Radomil (advisor)
Software implementovaný v rámci Fly-by-Wire systému firmy Honeywell je složen z mnoha modelů implementovaných v systému Simulink. Tato práce se zabývá hledáním přímých a nepřímých spojitostí mezi jednotlivými signály v systému těchto modelů. Jako vhodný aparát je zvolena teorie grafů. Na základě modelů jsou vygenerovány grafy a úloha nalézt spojitost mezi signály je převedena na úlohu nalézt cestu mezi dvěma vrcholy grafu. Známé algoritmy k vyhledávání cest v grafech určují délku nebo váhu nalezené cesty. Pro tuto aplikaci je ale potřeba rozlišovat cesty primární a sekundární bez ohledu na jejich délku. Proto jsou tyto známé algoritmy upraveny.
|
|
| |
|
|
Program for Automatic Playing of Solitaire and Mines
Přikryl, Stanislav ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The goal of this work is to design, then implement, and finally test a program that will automatically play the games Solitaire Klondike and Minesweeper. This goal was achieved using the Python programming language. We were able to create a program that is able to play the game of Minesweeper with a 91\% success rate of completing the game without stepping on a mine, and a program that is able to play the game of Solitaire Klondike, decide which move to use next, and if the game has a solution, successfully complete the game. The results of this work allow the reader to better understand the issues of both games and the problems that must be addressed during the implementation of a program that is intended to be used to play the games automatically. This thesis also outlines for the reader the various techniques that can be used when implementing a similar program.
|
|
| |
|
|
Griddlers Solver
Balcárek, Lukáš ; Čermák, Martin (referee) ; Goldefus, Filip (advisor)
The basic motive of this work is the logical game Griddlers. There are shown the various techniques for finding the right solution. To find solutions to the assignment are used uninformed and informed algorithms which are optimized for this logical game. Part of this work is also created console application demonstrating the search of the results from the given metadata. It is possible to test various specifications and observe the changing computing demands on them. This created application is designed to easily show the interconnection of artificial intelligence, algorithms and data processing in the selected game Griddlers.
|
guest ::
