- 1 (43.73 KiB) Viewed 24 times
Exercise 3 (Informed search) h=5 9= f= 2 h=3 39= 6 f= h=9 9= f= So संग 3 3 3 2 h=0 8 S2 $9) 9 = f= h=7 g= f= Consider th
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Exercise 3 (Informed search) h=5 9= f= 2 h=3 39= 6 f= h=9 9= f= So संग 3 3 3 2 h=0 8 S2 $9) 9 = f= h=7 g= f= Consider th
Exercise 3 (Informed search) h=5 9= f= 2 h=3 39= 6 f= h=9 9= f= So संग 3 3 3 2 h=0 8 S2 $9) 9 = f= h=7 g= f= Consider the search problem with the state space shown above. The step costs are shown on the edges, the initial state is so and the goal state is Sg. Each node is labelled by a heuristic value h. 3 a. Determine the f- and g-values of all nodes of the graph as they would be at the end of running the A* GRAPH-SEARCH algorithm. b. Determine the solution path found by the A* GRAPH-SEARCH algorithm as a sequence of nodes from s to Sg. What is the cost of the solution? c. Consider instead using the greedy best-first GRAPH-SEARCH algorithm on the same prob- lem. What is the cost of the solution found by that algorithm? Explain your answer.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!