Question 1: Inadmissible Heuristic Affects Completeness [50 points] We saw in the class that if the heuristic function h is inadmissible, A* search may find a suboptimal goal. We now show that A* may not even be complete, namely it may not terminate even if a goal with small cost exists. Consider the following graph where the right branch goes on forever: where A is the initial state C1 C2 C3 and G is the only goal state. Let cost(A, B)-1 /2, cost(B, G)-1 /2 so the solution path from A to G has a cost of 1. Furthermore, let so that the costs decrease by half toward the right Question 1: Inadmissible Heuristic Affects Completeness [50 points] We saw in the class that if the heuristic function h is inadmissible, A* search may find a suboptimal goal. We now show that A* may not even be complete, namely it may not terminate even if a goal with small cost exists. Consider the following graph where the right branch goes on forever: where A is the initial state C1 C2 C3 and G is the only goal state. Let cost(A, B)-1 /2, cost(B, G)-1 /2 so the solution path from A to G has a cost of 1. Furthermore, let so that the costs decrease by half toward the right