|
|
Logical Network Games for Android
Kubík, Michal ; Škoda, Petr (referee) ; Kouřil, Jan (advisor)
The main goal of this bachelor's thesis was the implementation of application for playing logical games. This work deals with Android platform and the possibilities of creation and deployment of applications for this platform. The known algorithms that are used for implementation of an artificial intelligence are described in the work. The ways of wireless communication between mobile device are also mentioned. The graphical user interface of application, solution of an artificial inteligence and the network communication are described in the implementation part of this work.
|
|
|
Optimization in graphs with bounded treewidth
Koutecký, Martin ; Kolman, Petr (advisor) ; Kráľ, Daniel (referee)
Courcelle's theorem speaks about computational complexity of decision problems defined by formulae in monadic second order logic over relational structures with bounded treewodth. For a fixed treewidth and a fixed formula, Courcelle's theorem gives an algorithm, which decides the formula over a structure of said treewidth in linear time. is thesis provides a self-contained proof of Courcelle's theorem using methods of finite model theory. Furthermore it contains the proofs of all propositions and theorems upon which the main proof depends, notably the Ehrenfeucht-Fraïssé theorem widely used in finite model theory. e thesis also contains an implementa- tion of an algorithm which follows from the main proof. Finally a sketch of the current state of the art of the area of research is given, as well as the possibilities following from it. 1
|
|
|
Optimization in graphs with bounded treewidth
Koutecký, Martin ; Kolman, Petr (advisor) ; Kráľ, Daniel (referee)
Courcelle's theorem speaks about computational complexity of decision problems defined by formulae in monadic second order logic over relational structures with bounded treewodth. For a fixed treewidth and a fixed formula, Courcelle's theorem gives an algorithm, which decides the formula over a structure of said treewidth in linear time. is thesis provides a self-contained proof of Courcelle's theorem using methods of finite model theory. Furthermore it contains the proofs of all propositions and theorems upon which the main proof depends, notably the Ehrenfeucht-Fraïssé theorem widely used in finite model theory. e thesis also contains an implementa- tion of an algorithm which follows from the main proof. Finally a sketch of the current state of the art of the area of research is given, as well as the possibilities following from it. 1
|
|
|
Webová aplikace pro vytváření logických herních úloh a jejich sdílení
Vlachovský, Jakub
Web application for logic games creation and sharing. Bachelor thesis. Brno: Mendel University, 2016. This thesis contains the concept of implementation and description of executing a web application providing a general interface to create and play certain types of logic games. It also includes the description of technology applied to create the application.
|
|
|
Logical Network Games for Android
Kubík, Michal ; Škoda, Petr (referee) ; Kouřil, Jan (advisor)
The main goal of this bachelor's thesis was the implementation of application for playing logical games. This work deals with Android platform and the possibilities of creation and deployment of applications for this platform. The known algorithms that are used for implementation of an artificial intelligence are described in the work. The ways of wireless communication between mobile device are also mentioned. The graphical user interface of application, solution of an artificial inteligence and the network communication are described in the implementation part of this work.
|
guest ::
