|
|
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.
|
|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
|
|
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.
|
|
|
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.
|
|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
|
|
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 ::
