|
|
Small games - gobblet - draw strategy
Bureš, Filip ; Majerech, Vladan (advisor) ; Sýkora, Ondřej (referee)
This diploma thesis focuses on finding a draw strategy in the game "Gobblet" and on finding the proof that the game can be a guaranteed draw. "Gobblet" is a board game for two players. The thesis provides the description of algorithms used for finding the proof of the guaranteed draw. The proof was made on a simplified variety of the game (limited to two types of playing pieces only). For this variety of the game, a draw strategy was found; this strategy was confirmed by the means of the above mentioned algorithms. Then, a more complicated variety of the game was tested (limited to three types of playing pieces). For this variety, the proof of the guaranteed draw was not possible to find. The non-success was due to the number of positions the game provides. The proof would not have been possible to make in a reasonable time span. The comprehensive variety of the game (four playing pieces) was not tested for the proof. The thesis merely outlines the strategy which should be used for finding the draw strategy.
|
|
|
Economic simulation
Meluzín, Jiří ; Zajíček, Ondřej (advisor) ; Majerech, Vladan (referee)
Design and implementation of economy society simulation (at country level). The aim is to simulate comodities and financy flow, supply and demand progress at each market and evolution of the cities. Exactnest of the simulation is not important, but the entertainment and the education aspects. The simulation should contains interactive graphic enviroment, which provides way to influence simulation model.
|
|
|
Non-optimal solver of permutational puzzles using divide and conquer technique
Penkala, Michal ; Majerech, Vladan (advisor) ; Vomlelová, Marta (referee)
In the present work I study the attributes of permutation puzzles and try to find the algorithms usable for solving these puzzles. The task of this project is to implement the algorithm for non-optimal solution of permutation puzzles by decomposition to sub problems and invent a suitable form of puzzle definition. The result of this project is a program with graphic interface, which allows the user to create custom permutation puzzle. With this puzzle, the user will be able to do the predefined moves, make custom positions and search the result of the position.
|
|
|
System Management Model of a Professional Service Firm
Hubík, Tomáš ; Křivánek, Mirko (advisor) ; Majerech, Vladan (referee)
In the presented work I devote to creating a computer model of a professional service firm using the theory of business modeling. The whole model was programmed using the application Vensim. Another part of this work was to use this model to answer some key questions about the professional service firms. I dealt with the issue of optimal volume and optimal size of potential orders. I have also studied the influence of marketing and employee productivity on business performance. Another part of the work was to find patterns in employees career growth and to monitor sales and quality of projects delivery. I also determined the size and characteristics of critical mass. Such a model could then be used to better understand patterns of companies in the professional services industry and we can use it to manage the company more effectively in this environment.
|
|
|
Comparison of Large Alphabet Compression Methods
Kuthan, Tomáš ; Lánský, Jan (advisor) ; Majerech, Vladan (referee)
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alphabet needs to be transferred between coder and decoder along with the message. Especially with small or middle-sized documents the code of the alphabet forms a signi cant part of the resulting le. Therefore it is desirable to represent the alphabet as dense as possible. The topic of this thesis is a comparison of three approaches to large alphabet compression - static, semiadaptive and adaptive approach. Moreover the potential of static initialization of adaptive methods with frequent words is analyzed. Furthermore a new and highly eff ective method for compression of a set of strings is introduced.
|
|
|
Mariáš Trainer
Caithaml, Tomáš ; Pudlák, Petr (advisor) ; Majerech, Vladan (referee)
In the present thesis we deal with designing a program to play training games of mariáš (traditional czech card game) against computer. Two three-player versions of this game are considered - volený mariáš and licitovaný mariáš. The program enables to play games in tournament mode simulating the real game as well as in training mode where player can look into opponent's hand, undo moves, replay different variations, get advice from computer and so analyse the game situation. It is possible to extend the program by artificial players and to set up tournament between them. The thesis introduces several implementations of artificial player based on enchanced alfa-beta prunning.
|
|
|
Abstract economic model with interface for user-defined agents
Hlava, Dalibor ; Zajíček, Ondřej (advisor) ; Majerech, Vladan (referee)
Title: Abstract economic model with interface for user-defined agents Author: Dalibor Hlava Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Mgr. Ondřej Zajíček, Department of Theoretical Computer Science and Mathematical Logic Abstract: The work comprises of simple economical, fully customizable model, that allows user or his agent to interact with world to maximize selected key performance indicators (happiness or population growth). Keywords: simulation, model, GUI
|
|
|
Business model of a central heating plant
Dlouhý, Petr ; Křivánek, Mirko (advisor) ; Majerech, Vladan (referee)
Presented thesis deals with the usage of computer simulations in management decision. Modeled environment is selected heat-distribution network, however model and its conclusions can be used for arbitrary heat - distribution network. Model is focused on business management view ofcontrol of heatand electricity generating sourcesdepending on power-producing market, weather and other varying parameters. Powered by TCPDF (www.tcpdf.org)
|
|
|
Approaches to computer cognition of musical recordings
Kadlec, Jan ; Majerech, Vladan (advisor) ; Obdržálek, David (referee)
In our study we deal with various stages of human cognition of real-life musical signals, create their models and discuss their implementation. The rst part compares time-frequency representations and their factorization into sinusoids and background noise. We combine various approaches to coupling sinusoids into trajectories. Next we examine methods for the estimation of note parameters from trajectories and methods for musical instrument classi cation. The nal part focuses on global music-theoretical features of recordings such as tempo, melodic phrases, chord accompaniment or key.
|
|
|
Effective Algorithms for Verifying Goals in Computer Games
Suda, Martin ; Hric, Jan (advisor) ; Majerech, Vladan (referee)
In the present work we study non-uniform methods for searching game trees of two player games with perfect information. Particularly the non-uniformity based on threats as realized in lambda search and dual-lambda search algorithms is investigated. Threats, de ned as such attack moves that if followed by a pass from the defender result in his certain loss, allow for a reduction of the search space while guaranteeing correctness at the same time. The work then describes a new method for construction of so called relevancy zones, a list of moves or places on the game desk that can only have in uence on the result of the problem in question. Using these zones it is possible to speed up the mentioned algorithms considerably. In the work there are also described three games, AtariGo, Hex and Go-Moku, and their appropriateness with respect to the studied methods is analyzed. Part of the work is also an implementation of the methods for these games using known techniques (transposition tables, history heuristic).
|
guest ::
