|
|
Maze-based 2D game
Čepelková, Kateřina ; Chlubna, Tomáš (referee) ; Vlnas, Michal (advisor)
This thesis focuses on the design and implementation of a maze generator using cellular automata and other algorithms. The goal is to integrate the generator into a labyrinth game using pathfinding and enemy placement techniques, specifically rejection sampling. The game is implemented in the Godot game engine. The final game features bonus in-game items, unique enemies with their own AI, and a level system. The benefit of the work is a universal maze generator that can be adapted for procedural generation of content in other games and expansion of the possibilities of game content creation.
|
|
|
Map Generator and Path Search in a Map for the Strategy Games
Karásek, Štěpán ; Mráček, Štěpán (referee) ; Orság, Filip (advisor)
This thesis consists of two parts. The first part deals with procedural map generation aiming at terrain generation. For the most part, the bases of terrain generation, usable algorithms and the ways of generating other landscape elements are followed up. A terrain generator using diamond-square algorithm is then implemented and integrated into the existing game engine. The second part of the thesis analyses the pathfinding problem, describes usable algorithms and one of them in detail. Furthemore, the post-processing of the path is being solved and possibilities of hierarchical pathfinding algorithms are presented. Pathfinding using A* algorithm is also implemented and integrated into existing game engine. Finally, functioanality of both the algorithms is demonstrated in an interactive application.
|
|
|
Map Generator and Path Search in a Map for the Strategy Games
Karásek, Štěpán ; Mráček, Štěpán (referee) ; Orság, Filip (advisor)
This thesis consists of two parts. The first part deals with procedural map generation aiming at terrain generation. For the most part, the bases of terrain generation, usable algorithms and the ways of generating other landscape elements are followed up. A terrain generator using diamond-square algorithm is then implemented and integrated into the existing game engine. The second part of the thesis analyses the pathfinding problem, describes usable algorithms and one of them in detail. Furthemore, the post-processing of the path is being solved and possibilities of hierarchical pathfinding algorithms are presented. Pathfinding using A* algorithm is also implemented and integrated into existing game engine. Finally, functioanality of both the algorithms is demonstrated in an interactive application.
|
guest ::
