Informed Search. Informed vs. Uninformed. Uninformed Search: just takes the information available in the problem description Informed Search: Takes additional problem specific properties to guide the search A way of “engineering knowledge” into the search. Best First Search.
f(node) = g(node) + h(node)
where, f is the evaluation function, g is the path from root, and h is the heuristic (estimate to goal)
f(n) <= f* (e.g. finite branch factor and minimum positive distance)
visits all the cities once