Question: Uninformed and Informed Search Again! (30 points) For the graph and the heuristic function given below, apply the following search algorithms to find the path

Uninformed and Informed Search Again! (30 points) For the graph and the heuristic function given below, apply the following search algorithms to find the path from 1 (starting node) to 5 (goal node). Also, show the order in which the nodes are expanded as well as the contents of the fringe after each expansion. Note: When there is a tie for expansion, the lower node number has higher priority. Clearly state any assumptions you made while solving the problems. Heuristic function: - h(1)=10 - h(2)=9 - h(3)=2 - h(4)=3 - h(5)=0 (a) Depth First Search (5 points) (b) Iterative Deeping Search (5 points) (c) Breadth First Search (5 points) (d) Greedy Best-First Search (5 points) (e) Uniform Cost Search (5 points) (f) A* Search (5 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
