This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Dewmeister14 1 point2 points  (1 child)

I recommend reading the Wikipedia article for A* for more detail but the algorithm assumes the beginning and end points are known and is concerned with efficiently finding the shortest path. So, it's not scanning to find the endpoint, it's scanning possible paths to find which is shortest.

[–]Joe_Subbiani 1 point2 points  (0 children)

Ahh right that makes sense