Pathfinding

Heuristic Utilization

In game AI we are always looking for opportunities to optimize performance. The pathfinding algorithms that I worked on incorporated the use of heuristic functions which act as "best guesses" which lead to rapid code execution. Because of these heuristic functions, the pathfinding script doesn't have to iterate through every possible scenario.

Incremental Algorithms

The pathfinding algorithms I implemented make use of incremental solutions which allows computations to be made across several frames. This prevents the game from computational bottlenecks associated with single frame algorithms.

Algorithm Development

Programming AI can be quite computationally expensive which is why it is important to use known techniques for developing AI pathfinding algorithms. This project gave me hands on experience with programming various pathfinding behaviors using methods such as Dijkstra's algorithm and Breadth-First search.

C#

Unity

Game AI

Pathfinding Algorithms