Pathing Flashcards

1
Q

Describe and implement an A* search, from memory

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Describe and implement Djikstra’s Algorithm, from memory

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly