|
|
Evaluation function for Atari-go
Kudělka, Miloš ; Majerech, Vladan (referee) ; Hric, Jan (advisor)
The present work describes a design and an implementation of Atari Go computer game. This includes an implementation of mini-max and mini-max with alpha-beta pruning algorithms for searching for the best moves. Additionally, the work describes the design and the implementation of an evaluation function and the selection of suitable criteria of the position. This function then can evaluate the position by evaluating these criteria. Further on, the work demonstrates one style of improving the parameters of evaluation function - simple learning algorithm is designed, applied to this problem and implemented. This algorithm improves the parameters by playing games. The results of improvings are presented in the work, too.
|
|
|
Gobblet game from the point of artificial intelligence
Kotrč, Pavel ; Majerech, Vladan (referee) ; Vomlelová, Marta (advisor)
Gobblet is a new abstract board game, rules of which are based on the classic 4-in-arow game played on 4×4 board. However, the ability to gobble up and move the pieces on the board greatly increases its complexity and Gobblet is thus comparable to games like Checkers or Othello. That makes it interesting from the artificial intelligence point of view. This thesis explores the possibilities of classic and more recent methods for searching the Gobblet game tree - the minimax algorithm, alpha-beta pruning, a heuristic for move ordering, iterative deepening and others. The resulting algorithm is compared to the computer players on the Boardspace game server where it plays above-average with the best-playing robot. Implementation of all described algorithms and a graphical user interface for testing them in the Java programming language is an inseparable part of this thesis.
|
|
|
Web applications testing
Borovcová, Anna ; Parízek, Pavel (referee) ; Majerech, Vladan (advisor)
This diploma thesis matter is explanation of web application testing problems mainly to potential testers. That is why the thesis confides information gathered from different sources in intelligible way and it results from three years of testing and one year of teaching new testers mainly in Unicorn Corporation. The first part is dedicated to introduction to web testing; basic principles and history of internet, development process and methodologies are mentioned there. The second part deals with core aspects of testing and how they are viewed by various experienced testers from Czech Republic or foreign countries. In the third part there are chosen and introduced some techniques and tools suitable for web application. The fourth part contains practical example of some testing documents.
|
|
|
Economic simulation
Meluzín, Jiří ; Majerech, Vladan (referee) ; Zajíček, Ondřej (advisor)
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.
|
|
|
Go on Small Boards
Čížek, Pavel ; Majerech, Vladan (referee) ; Hric, Jan (advisor)
In presented work we study applicability of the heuristics used in computer analysis of the chess (to be specific we will consider transposition tables, killer moves, history heuristics and counter-moves) for the valuation of the position in the go. In the first part will try to deal with problems which arises, because rules and behaviour of the chess and go are really different in some ways. Obtained heuristics had been implemented and at the end we will try to evaluate their efficiency and mutual (in)dependence experimentally using this program to solve some simple positions.
|
|
|
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)
|
|
| |
|
|
Effective Algorithms for Verifying Goals in Computer Games
Suda, Martin ; Majerech, Vladan (referee) ; Hric, Jan (advisor)
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).
|
|
|
Suffix Tree Construction Algorithms
Host, Ján ; Majerech, Vladan (referee) ; Senft, Martin (advisor)
In the present work we study suffix tree construction algorithms. This structure helps solving a variety of text problems in optimal time. There are several approaches and algorithms for building a suffix tree. The goal is to create a taxonomy of these algorithms and provide an overview of their properties and suitable usage. The algorithms important from various points of view are presented. Fundamentals and main ideas of their work are explained. Consequently, they are compared in tests to reveal their main flaws and strength. According to the test results as well as to theoretical knowledge and to information gained from previous studies common features are determined and after presenting the appropriate criteria a taxonomy is created.
|
|
|
Mariáš Trainer
Caithaml, Tomáš ; Majerech, Vladan (referee) ; Pudlák, Petr (advisor)
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.
|
guest ::
