Heuristic Functions are Fallible

Sliding tile 1 increases the heuristic by one, while sliding tile 5 or 7 leaves the heuristic unchanged.

The best-first algorithm would choose sliding tile 5 or 7, but to solve this puzzle either tile 1 or tile 2 will have to be moved out of place temporarily.