Question: Problem 1. Consider the search space shown in the figure below. In this problem the start state is S, and the goal state is G.

Problem 1. Consider the search space shown in the figure below. In this problem the start state is S, and the goal state is G. The transition costs are next to the edges, and the heuristic estimate are given inside the nodes. Assume ties are always broken by choosing the state which comes first alphabetically Part a) [2+3 Points] i) Is the heuristic function admissible? (Give. Reason) ii) Is the heuristic function consistent? (Give Reason) Part b) What is the order of states expanded and the path found by A graph search algorithm when used on this problem? Also specify the nodes in the fringe/frontier/Queue when the goal is found. [3+2+1Points]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
