A* works in a similar fashion to Dijkstra's algorithm. However, instead of choosing the real lowest-cost node from all the possible options, it chooses the most promising one based on a given heuristic, and goes that way. In our case, the default heuristic is based solely on the Euclidean distance between two vertices with the option of using Manhattan distance.
How it works...
Get Unity 2018 Artificial Intelligence Cookbook - Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
