|
|
Game in OpenGL
Hranáč, Pavel ; Milet, Tomáš (referee) ; Starka, Tomáš (advisor)
The goal of this thesis is to create a custom game with an AI opponent. The theoretical part of the thesis deals mainly with artificial intelligence in games in general. The game's graphics are three-dimensional and use the OpenGL API and the GPUEngine graphics library. The created game is a turn-based strategy game similar to chess, offering computer opponents of various difficulties using a custom modification of the Minimax strategy with a complex heuristic. The game also offers local multiplayer. The results of this thesis can serve as inspiration or a basis for the study of artificial intelligence in games.
|
|
|
Multi-Agent and Optimalisation Methods for Stealth Games
Láncoš, Jan ; Vídeňský, František (referee) ; Zbořil, František (advisor)
This bachelor thesis deals with the opponents' behaviour in stealth-based video games. It's main focus is the credibility of said behaviour in comparison to the opponents' real life counterparts and the overall immersiveness of the experience. The thesis describes the usage of the A* algorithm for dynamic pathfinding in a two-dimensional space. Furthermore it describes the opponents' patrolling system, their ability to detect the player's presence and also their ability to cooperate and communicate while trying to chase the player down. One playable level demonstrating the described behaviour has also been created as part of this thesis using the C++ language. The thesis can be used as an inspiration for anyone interested in making their own intelligent systems for computer games of a similar type.
|
|
|
Game in OpenGL
Hranáč, Pavel ; Milet, Tomáš (referee) ; Starka, Tomáš (advisor)
The goal of this thesis is to create a custom game with an AI opponent. The theoretical part of the thesis deals mainly with artificial intelligence in games in general. The game's graphics are three-dimensional and use the OpenGL API and the GPUEngine graphics library. The created game is a turn-based strategy game similar to chess, offering computer opponents of various difficulties using a custom modification of the Minimax strategy with a complex heuristic. The game also offers local multiplayer. The results of this thesis can serve as inspiration or a basis for the study of artificial intelligence in games.
|
|
|
Multi-Agent and Optimalisation Methods for Stealth Games
Láncoš, Jan ; Vídeňský, František (referee) ; Zbořil, František (advisor)
This bachelor thesis deals with the opponents' behaviour in stealth-based video games. It's main focus is the credibility of said behaviour in comparison to the opponents' real life counterparts and the overall immersiveness of the experience. The thesis describes the usage of the A* algorithm for dynamic pathfinding in a two-dimensional space. Furthermore it describes the opponents' patrolling system, their ability to detect the player's presence and also their ability to cooperate and communicate while trying to chase the player down. One playable level demonstrating the described behaviour has also been created as part of this thesis using the C++ language. The thesis can be used as an inspiration for anyone interested in making their own intelligent systems for computer games of a similar type.
|
guest ::
