|
|
Multiplatform Card Game with Artificial Intelligence
Trejtnar, Martin ; Chlubna, Tomáš (referee) ; Matýšek, Michal (advisor)
This thesis focuses on artificial intelligence in card games. The goal is to implement a multi-platform game of this genre in the Unity game engine, to summarize possible approaches that are being used in order to create intelligent agents and furthermore to design and describe the most suitable method or combination of methods for the chosen game. The research that was carried out has shown that the problem domain of card games is rather specific, making it more difficult to use the general-purpose algorithms. The problem given was solved using the rule-based artificial intelligence. The intelligent agent has been implemented for a game of imperfect information, which is considered to be the main contribution of this work to the community. Even though the artificial intelligence player is making minor tactical mistakes, his behavior closely resembles the way of thinking of semi-experienced players.
|
|
|
A model of two-level politics: the case of I.R. Iran's nuclear program
Habibpour Moghaddam, Ehsan ; Tesař, Jakub (advisor) ; Karlas, Jan (referee)
This research undertakes an exploration of the intricate dynamics in foreign policy strategies between the U.S. and the Islamic Republic of Iran (I.R.), primarily focusing on the I.R.'s nuclear program. A game theory framework forms the basis of this study, helping to elucidate the complex interplay between international diplomacy, domestic political forces, and strategic decision-making mechanisms. After conducting a chronological examination of the nuclear issue, from its origins through to the ongoing negotiations, this study introduces several models. These are built upon the theoretical pillars established by De Mesquita's (2010) work on modeling I.R.-U.S. nuclear controversy and Putnam's (1988) analysis of the interplay between domestic and international politics. These models capture two significant elements: 1) the substantial influence of domestic politics within both countries on foreign policy outcomes, and 2) how shifts in each influential parameter within the model affect the outcome of the game. The study underscores how the dynamics of factors such as potential for military action, perceived power status of the involved players, and domestic political pressures critically influence each country's negotiation strategies and potential outcomes within the game's structure. Additionally,...
|
|
|
Investigation of Game Strategies and Behavior of Virtual Game Players
BLOVSKÝ, Petr
The bachelor thesis deals with the design and creation of three games for two players and the subsequent analysis of the optimal strategies of these games, which are implemented in the virtual meta version Neos. The search for the optimal strategy is first carried out theoretically using game theory and then experimentally, by monitoring the virtual players playing these games. The strategies that players choose in these games are mainly monitored. The selected strategies are then recorded and the results are processed and compared with the results obtained using game theory. Part of the bachelor thesis is also a detailed description of creating games and calculating optimal strategies.
|
|
|
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search as well as alfa-beta algorithm and expectimax were used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
|
|
|
Prisoner's Dilemma
ČAPKOVÁ, Tereza
This thesis deals with studying the prisoner's dilemma in an iterated form, which represents a way of playing this game when players compete in multiple rounds and have the opportunity to change their strategy based on experience from previous games. The aim of the thesis is to evaluate suitable strategies for the iterated prisoner's dilemma based on information about the other player, such as gender, age, or other characteristics. The thesis also focuses on analyzing which player information is significant for changing player behavior and to what extent player strategies coincide with known strategies from AI tournaments. The introductory part of the thesis presents basic concepts of game theory and the prisoner's dilemma. Important terms related to the iterated form of the game, such as repeated play, the possibility of strategy change, and cooperation between players, are also explained. Classic prisoner's dilemma strategies, such as Dove, Hawk, and Copycat, are also introduced. In the practical part of the thesis, a web application is described that was created to simulate an economic conflict between a customer and a craftsman. This application allows players to play the iterated prisoner's dilemma and change their strategy based on experience from previous games. The application contains various AI strategies that players can play against. Player behavior data is collected and subsequently analyzed using observations and statistical methods. The results of this thesis show that there is almost no difference in play between men and women, and significant differences can only be observed between younger and older player groups. This assertion was verified in the thesis using a chi squared test. In conclusion, an optimal strategy was found against different player groups, which is cooperation throughout and betrayal in the final round.
|
|
|
Selected applications of mathematics
KRATOCHVÍL, Daniel
The thesis is a contribution to the topic of game theory which belongs to the field of applied mathematics. The work is divided into three parts. In the first part, the basic terminology of game theory is introduced and subsequently applied in conflict mathematical model situations. The second part deals with the history of game theory and presents some historical problems as well as milestones in this area of mathematics. The last part is focused on different variants of NIM games, their analysis and the search for an optimal strategy.
|
|
|
Mathematical games
BOUBLÍKOVÁ, Hana
The bachelor thesis is concerned with solutions of mathematical games intended for students of upper primary school (including verbal and geometric games and games focused on withdrawing objects). Its aim was finding winning strategies of players and their undestandable explanation. The thesis also contains illustrations of winning moves in particular games.
|
|
|
Application of game theory in terms of traffic flows
WAGNER, Pavel
This thesis deals with application of game theory in traffic flow conditions and operating. Transport is literally phenomenon present - day time. Except undisputed positive effects though the accumulative transportation has also its negative effects. Frequent transport congestions, increasing emissions and implicit economics losses on the side of drivers. The main goal of the thesis work is analysis of usage game theory in traffic flow conditions and operating. At present trend of rising population and thereby connected trouble with overloaded transportation with shows that the it is constantly needed to improve transport logistic and thereby increase fluency of road traffic. This thesis describes ones of the possible solution - application game theory in traffic flow operation with a concentration on behavior of drivers.
|
|
|
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search was used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
|
|
| |
guest ::
