|
|
Triplanetary
Huječek, Adam ; Cibulka, Josef (advisor) ; Gemrot, Jakub (referee)
The main purpose of this work is to bring the almost forgotten turn-based board game Triplanetary from the 70s and the beginning of the 80s of the last century to the screens of today's computers. The program allows multiple players to play on one computer in the so called hotseat mode two of the several scenarios available in the original game - racing Grand Tour with the option to play with computer controlled opponents and battle Nova for three players. However thanks to the suitable design it is easy to implement the rest of scenarios or of course add completely new ones provided the user has the knowledge of JAVA which the game is programmed in. Another advantage is the option to save and exit the game at any time and return to it later.
|
|
|
Software package for polyhedra operation
Steffanová, Veronika ; Hladík, Milan (advisor) ; Cibulka, Josef (referee)
Title: Software package for polyhedra operation Author: Veronika Steffanová Department: Department of Applied Mathematics Supervisor: Mgr. Milan Hladík, Ph.D., Department of Applied Mathematics Abstract: The topic of the thesis is focused on convex polyhedra and algorithms for working with them. At first we give the theorem about vertex and facet description and then we describe selected algorithms connected to the problem of the conversion between these two descriptions. In the practical part we implement three functions using three selected algorithms and a few other functions, which are simple results of the three algorithms. Finally we get a MATLAB library, which contains functions for vertex enumeration, facet enumeration, convex union of two polyhedra, intersection of two polyhedra and irredudancy problem for facets and vertices, too. By the way we compare our two implemented algorithms for facet enumeration, but not only accor- ding the running time, also according the memory requirements and the implemen- tation complexity. Keywords: polyhedron, MATLAB, linear programming, convex hull 1
|
|
|
Erdos-Szekeres type theorems
Eliáš, Marek ; Matoušek, Jiří (advisor) ; Cibulka, Josef (referee)
Let P = (p1, p2, . . . , pN ) be a sequence of points in the plane, where pi = (xi, yi) and x1 < x2 < · · · < xN . A famous 1935 Erdős-Szekeres theorem asserts that every such P contains a monotone subsequence S of √ N points. Another, equally famous theorem from the same paper implies that every such P contains a convex or concave subsequence of Ω(log N) points. First we define a (k + 1)-tuple K ⊆ P to be positive if it lies on the graph of a function whose kth derivative is everywhere nonnegative, and similarly for a negative (k + 1)-tuple. Then we say that S ⊆ P is kth-order monotone if its (k + 1)- tuples are all positive or all negative. In this thesis we investigate quantitative bound for the corresponding Ramsey-type result. We obtain an Ω(log(k−1) N) lower bound ((k − 1)-times iterated logarithm). We also improve bounds for related problems: Order types and One-sided sets of hyperplanes. 1
|
|
|
Perfect tilings of simplices
Safernová, Zuzana ; Cibulka, Josef (referee) ; Matoušek, Jiří (advisor)
In the present work we study the problem of k-reptile d-dimensional simplices. A simplex is called a k-reptile if it can be tiled in k simplices with disjoint interiors that are all congruent and similar to S. The only k-reptile simplices that are known for d 3 have k = md, where m 2. We also show an idea of Matoušek's proof of nonexistence of 2-reptile simplices of dimensions d 3. We correct a mistake in the proof. Then we give several geometric observations for k = 2. At the end we prove that there is no 3-reptile simplex for d = 3.
|
|
|
Ramseyovské otázky v euklidovském prostoru
Cibulka, Josef ; Černý, Jakub (referee) ; Valtr, Pavel (advisor)
One of the problems in Euclidean Ramsey theory is to determine the chromatic number of the Euclidean space. The chromatic number of a space is the minimum number of colors with which the whole space can be colored so that no two points of the same color are at unit distance. We prove that the chromatic number of the six-dimensional real space is at least 11 and that the chromatic number of the seven-dimensional rational space is at least 15. In addition we give a new proof of the lower bound 9 for the chromatic number of the five-dimensional real space. We also simplify the proof of the lower bound 7 for the four-dimensional real space. It is known that the chromatic number of the n-dimensional real space grows exponentially in n. We show some of its subspaces, in which the growth is slower than exponential. We also summarize previous results for normed spaces in general and for some interesting non-Euclidean spaces.
|
|
|
Comparing chess strategies
Kacz, Kristián ; Babilon, Robert (referee) ; Cibulka, Josef (advisor)
The aim of this work is to provide an overview of approaches in computer chess. It designs and implements a chess engine for multiplayer network chess program ChessNet. Within the engine implements several search algorithms like Negamax, Alpha-beta, Negascout and points to their weaknesses. Adds a possibility to the ChessNet environment to compare chess engines. Compares implemented algorithms in terms of time complexity. Shows several factors wich we have to take into consideration during the design of evaluation function of game states. Implements some such functions and compares them in terms of success against each other.
|
|
|
Ditchers
Slabý, David ; Cibulka, Josef (referee) ; Lidický, Bernard (advisor)
The aim of this work is to combine the playability and the idea of the legendary game Tunneler with the option of programming arti cial intelligence for computer players. Writing scripts and their use in the game is separated from the game itself, so the author of a script only has to know the scripting language and a few interface functions to successfully create an intelligent robot. At the same time the game is suffciently attractive to casual players, it is easy to operate and has some additional features, such as multiple weapons, maps and robot types. Another important feature is the option of playing over LAN.
|
|
|
Strategies for generalized Reversi
Tupec, Radek ; Lidický, Bernard (referee) ; Cibulka, Josef (advisor)
The aim of this work is to design generalized Reversi (also known as Othello) and implement the application for editing and testing strategies of artificial intelligence. In the beginning of the work full rules of the game and solved problems are presented. After that follows detailed description of implemented strategies, programmer and user manual. At the conclusion of the work there is the report about using the application and possible extensions of the application.
|
|
|
Samodlážditelné simplexy
Safernová, Zuzana ; Cibulka, Josef (referee) ; Matoušek, Jiří (advisor)
In the present work we study tetrahedral k-reptiles. A d-dimensional simplex is called a k-reptile if it can be tiled in k simplices with disjoint interiors that are all congruent and similar to S. For d = 2, triangular k-reptiles exist for many values of k and they have been completely characterized. On the other hand, the only simplicial k-reptiles that are known for d 3 have k = md, where m 2 (Hill simplices). We prove that for d = 3, tetrahedral k-reptiles exist only for k = m3. This partially confirms the Hertel's conjecture, asserting that the only tetrahedral k-reptiles are the Hill tetrahedra. We conjecture that k = md is necessary condition for existence of d-dimensional simplicial k-reptiles, d > 3.
|
|
|
Ramseyovské otázky v euklidovském prostoru
Cibulka, Josef
One of the problems in Euclidean Ramsey theory is to determine the chromatic number of the Euclidean space. The chromatic number of a space is the minimum number of colors with which the whole space can be colored so that no two points of the same color are at unit distance. We prove that the chromatic number of the six-dimensional real space is at least 11 and that the chromatic number of the seven-dimensional rational space is at least 15. In addition we give a new proof of the lower bound 9 for the chromatic number of the five-dimensional real space. We also simplify the proof of the lower bound 7 for the four-dimensional real space. It is known that the chromatic number of the n-dimensional real space grows exponentially in n. We show some of its subspaces, in which the growth is slower than exponential. We also summarize previous results for normed spaces in general and for some interesting non-Euclidean spaces.
|
guest ::
RSS feed.