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.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |