Pathing Flashcards
1
Q
Describe and implement an A* search, from memory
A
-
2
Q
Explain the Hvalue, Gvalue, and F within an A* search
A
Hvalue is the heuristic value representing the distance from the goal node; best precomputed if static
Gvalue represents the distance from the origin node, by traversing the parent node path
Fvalue is the sum of Hvalue and Gvalue
3
Q
Describe and implement Djikstra’s Algorithm, from memory
A
-