Unformatted text preview: Show the resulting search tree, including the f-value, g-value, and h-value of each node. Also clearly indicate the order in which the nodes are expanded (= label the node expanded ﬁrst with 1, the node expanded next with 2, and so on - do not forget to label those nodes whose expansion only generates states that have already been expanded). A (h=5) C (h=4) I (h=3) E (h=2) J (h=2) G (h=4) F (h=2) K (h=1) M (h=0) 1 3 4 2 4 1 1 2 2 4...
View Full Document
- Fall '08
- Graph Theory, Distance, Shortest path problem, 1 m, Intelligent Systems, Consistent heuristic