|
| |
|
|
Scrabble
Picek, Radomír ; Glembek, Ondřej (referee) ; Smrž, Pavel (advisor)
This thesis describes the social table game Scrabble, and its realization in the form of computer games. Gradually examines all important aspects that affect the performance of the implementation. Especially after the election of the appropriate data structures retained for the vocabulary, affecting the efficiency of generating moves, and the selection of appropriate algorithms with regard to the maximum speed. There is particular emphasis on artificial intelligence opponent and its ability to compete not only amateurs, but professional SCRABBLE players.
|
|
|
Game Environment Checking by a Swarm of Autonomous Agents
Heindlová, Tina ; Nečasová, Gabriela (referee) ; Zbořil, František (advisor)
This thesis studies engine Enfusion and how to start with it. It describes the creation of a minigame to introduce the engine. Further, a backtracking algorithm for the detection of inconsistent states in the game worlds is introduced. Thesis describes how to create a simple world and its testing. The algorithm is tested and the testing results are discussed. In the end, it describes more methods of solutions.
|
|
|
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.
|
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
|
|
Mobile Application for Scanning Sudoku from Newspapers and Finishing It
Lazorík, Juraj ; Kanich, Ondřej (referee) ; Dyk, Tomáš (advisor)
This bachelor thesis describes the creation of a mobile application, that scans sudoku layout from the newspaper and allows its solving. The application is developed for the Android and is implemented in Kotlin. Scanning is done by taking picture of layout with camera. Basic image processing methods such as thresholding or Canny's edge detector are used to detect the sudoku layout. Number recognition is provided by convolution neural network with 99.08 % accuracy. The application allows solving sudoku with hints. Elimination methods and backtracking are used to find solution. Each scanned sudoku is stored in the database so the user can always return to any game. The final version of the application is published in the Google Play store.
|
|
|
Sudoku Generator and Solver
Polínková, Eliška ; Čermák, Martin (referee) ; Goldefus, Filip (advisor)
This thesis discusses ways of generating and solving Sudoku games. It describes possible approaches to problem solving, namely: the use of logical methods and the use of state space search methods. Practical part of this work involves the design and implementation of application enabling the generating, solving, verification of attributes, creating your own sudoku problem and export games to XML file.
|
|
|
Mobile Application for Scanning Sudoku from Newspapers and Finishing It
Lazorík, Juraj ; Kanich, Ondřej (referee) ; Dyk, Tomáš (advisor)
This bachelor thesis describes the creation of a mobile application, that scans sudoku layout from the newspaper and allows its solving. The application is developed for the Android and is implemented in Kotlin. Scanning is done by taking picture of layout with camera. Basic image processing methods such as thresholding or Canny's edge detector are used to detect the sudoku layout. Number recognition is provided by convolution neural network with 99.08 % accuracy. The application allows solving sudoku with hints. Elimination methods and backtracking are used to find solution. Each scanned sudoku is stored in the database so the user can always return to any game. The final version of the application is published in the Google Play store.
|
|
|
Game Environment Checking by a Swarm of Autonomous Agents
Heindlová, Tina ; Nečasová, Gabriela (referee) ; Zbořil, František (advisor)
This thesis studies engine Enfusion and how to start with it. It describes the creation of a minigame to introduce the engine. Further, a backtracking algorithm for the detection of inconsistent states in the game worlds is introduced. Thesis describes how to create a simple world and its testing. The algorithm is tested and the testing results are discussed. In the end, it describes more methods of solutions.
|
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
guest ::
