Abstract
In this project, the main field was pathfinding in computer games.
Pathfinding is an approach to find out the shortest path between two point.
Moreover, pathfinding is also one of the main elements in computer games. Without
pathfinding, a game will lose it's interesting features. There were many algorithms
developed for this purpose. Different algorithm has different implementation, gives
different impact in certain scenario, and also been influenced by certain factors.
Thus, we have to study about their advantages and disadvantages, as well as their
efficiency in certain situation. Next, an algorithm will be selected to be applied into
coding which is reusable when developing another game.
Website : http://ir.fsksm.utm.my/2934/
No comments:
Post a Comment