Informed and Uninformed Search
Informed and Uninformed Search
Informed and Uninformed Search
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Best First <strong>Search</strong>• Take the basic tree search algorithm• f(n) evaluation function determines expansion order• f(n)=g(n)+h(n)CSI 435/535 - Introduction to A.I. : <strong>Informed</strong><strong>and</strong> <strong>Uninformed</strong> <strong>Search</strong>65Simplest <strong>Informed</strong> <strong>Search</strong>• f(n) = h(n)– h is some heuristic function that estimates costfrom n to goal, h(n) = 0, if n = goal• Results in a greedy search technique thatfinds local minimaCSI 435/535 - Introduction to A.I. : <strong>Informed</strong><strong>and</strong> <strong>Uninformed</strong> <strong>Search</strong>6633
Change language