Part b

Non-admissable heuristics (a) Invent a heuristic function h for the 8-puzzle that sometime overestimates, and show how it can lead to a suboptimal solution on a particular (i.e., example) problem. (b) Let C* refer to the cost of the optimal solution to an 8-puzzle problem. Prove that if your heuristic h overestimates by at most a constant c, then using A* with h will return a solution with cost that is at most c+C*