Next: Example Previous: Informed Searches

Best-First Search

queueing-fn is sort-by-h

h(n) is estimated distance remaining to the nearest goal state

Best-First Search is only as good as its heuristic

Example Heuristic: Manhattan Distance Function for 8 puzzle