But you can’t guarantee that it will never overestimate a best path cost. “we prove that Q* search is guaranteed to find a shortest path given a heuristic function that neither overestimates the cost ...