Consider the state space shown to the left, where the number by each state n is the path cost and the table to the left shows the heuristic evaluation of the cost from each node n to the goal.
Write down the order that the nodes would be searched in
(a) Breadth first search
(b) Depth-first search
(c) Uniform-cost search
(d) Iterative depth-first search
(e) Greedy best-first search
(f) A* search
(g) For item (c) – calculate the overhead incurred by the iteration.
Get Free Quote!
449 Experts Online