b с g 20 20 10 a 40 20 g′ 11 d 10 20 g" a tree for g
Using the image provided, please answer the following questions.
(a). Find a path from a to g in the graph G using the search strategy of depth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".
(b). Find a path from a to g in the graph G using the search strategy of breadth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".
(c). Find a path from a to g in the graph G using the search strategy of least-cost first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".
(d). Find a path from a to g in the graph G using the search strategy of best-first search. The heuristics for these nodes are: h(a,25); h(b, 43); h(c,5); h(d, 64); h(g, 0). Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal or "why-non-optimal".
(e). Suppose AGAIN the heuristics of h(a,25); h(b, 43); h(c,5); h(d, 64); h(g, 0). Find a path from a to g in the graph G using the search strategy of A* search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".
(f). Suppose the heuristics is now UPDATED to h(a,5); h(b, 9); h(c,5); h(d, 29); h(g, 0). Find a path from a to g in the graph G using the search strategy of A* search again. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal".
(g). Suppose the heuristics is FURTHER UPDATED to h(a,5); h(b, 8); h(c,5); h(d, 9); h(g, 0). Find a path from a to g in the graph G using the search strategy of A* search again. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". What would be your additional comments in terms of the solution path finding under this heuristics?
Step by step
Solved in 2 steps
