Assume also that the ESTIMATED
distances to the goal are given by the following table:
Node: | S | A | C | D | F | G | H | ||||||||
Estimated Distance to G: | 10 | 5 | 4 | 3 | 4 | 0 | 2 |
For EACH of the following search methods:
Search Tree:
S / \ A F / \ C F / \ D G | G * goal
Queue:
Depth First Expanded Queue S [(S)] A [(A,S) (F,S)] C [(C,A,S) (F,A,S) (F,S)] D [(D,C,A,S) (G,C,A,S) (F,A,S) (F,S)] G [(G,D,C,A,S) (G,C,A,S) (F,A,S) (F,S)] goal reached!
List of expanded nodes: [S, A, C, D, G]
Resulting path: SACDG
Cost of resulting path: 12
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path:
Search Tree:
Queue:
List of expanded nodes:
Resulting path:
Cost of resulting path: