hw3 - Show the resulting search tree, including the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS4600 - Introduction to Intelligent Systems Homework 3 - Search Consider the graph given above. It shows the actual distances between cities on a map. Each city is labelled with an estimate of the distance of the city from city M. Each path from a city to its neighbor is labelled with the length of the path. Consider an informed search for a shortest path from city A to city M using these estimates as heuristic function. Show how a version of A* would find this path. Assume that A* never expands the same state more than once and that it breaks ties toward cities with names earlier in the alphabet (A before B, B before C, and so on).
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

This note was uploaded on 09/10/2008 for the course CS 460 taught by Professor Svenkoenig during the Fall '08 term at Urbana.

Ask a homework question - tutors are online