Shortest Path Problems
	• When the graph becomes too large blind search is no longer practical • Problem is that blind search does not look in the right places • To see this think of the search pattern of Uniform Cost Search • On the next 2 slides we will see an example based on a map of Romania – from AIMA – These include an animation of how UCS performs the search, hence printed version will be a mess!