Algoritmy pro hledání nejkratší cesty v počítačových hrách
Loading...
Files
Downloads
1
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská – Technická univerzita Ostrava
Location
Signature
Abstract
The goal of this bachelor thesis is to design and develop a computer game in Python programming language, study and implementation of chosen algorithms for pathfinding, their demonstration in the computer game and comparison of the algorithms. The reader of this thesis will obtain knowledge about the idea behind shortest pathfinding in computer games, which algorithms solve this problem, how these algorithms work and how to implement them. The reader will also get to know the basic steering behaviour techniques and gaming mechanics, such as attacking or sprinting.
Description
Subject(s)
pathfinding, A*, DFS, BFS, dijkstra, IDA*' SMA*, HPA*, python, pygame