This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1002 of 2,872·23. Shortest Path AlgorithmsPro lesson
The f(n) Evaluation Function
Learn how A* combines g(n) (actual cost) and h(n) (heuristic) into f(n) = g(n) + h(n) for node evaluation.