Searches
A helpful link on searches can be found at
http://www.cc.gatech.edu/classes/cs3361_96_spring/Fall95/Notes/search.html
Scroll down to these topics:
1. BLIND SEARCH --- DEPTH-FIRST and BREADTH-FIRST
2. BLIND SEARCH --- BRANCH AND BOUND
Uniform Cost Search (Branch and Bound)
g*(n) = cost so far
3. HEURISTIC SEARCH --- TYPES OF HEURISTICS
4. HEURISTIC SEARCH --- BEST-FIRST
h*(n) = estimated cost to the goal
5. HEURISTIC SEARCH --- BEAM SEARCH
6. HEURISTIC SEARCH --- HILL CLIMBING
7. HEURISTIC SEARCH --- A* (OPTIMAL ADMISSABLE SEARCH)
A* (Best Search Technique): f*(n) = g*(n) + h*(n)