4.7 Prove that if the heuristic function h obeys the triangle inequality, then the/-cost along any path
Question:
4.7 Prove that if the heuristic function h obeys the triangle inequality, then the/-cost along any path in the search tree is nondecreasing. (The triangle inequality says that the sum of the costs from A to B and B to C must not be less than the cost from A to C directly.)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Artificial Intelligence A Modern Approach
ISBN: 9780131038059
1st Edition
Authors: Stuart Russell, Peter Norvig
Question Posted: