Notifications
Pathfinding Algorithms Comparison
Showcase
26
0
Pathfinding Algorithms Comparison with a certain 64x32 Graph

A* Search is the best implementation for most of the maps and found to be superior to other approaches in term of Distanced Traveled per Time Complexity ratio

All of the movement-cost distances used in this Path-finding are Euclidean Distances and different results for different Heuristic-costs are also pointed out.
Tutorial - https://www.udemy.com/pathfinding-in-unity/
Music - http://ericskiff.com/music/

Hikari Akio
Programmer - Student
10
Comments