| Informed
search |
|
|
|
|
|
|
|
|
|
|
|
| ¡ | Heuristic
function h(n) = |
|||||||||
| cost of the
cheapest path from n to |
||||||||||
| goal. |
||||||||||
| ¡ | Greedy Best
First Search |
|||||||||
| l | Minimizing
estimated cost to goal |
|||||||||
| ¡ | A* Search |
|||||||||
| l | Minimizing
total cost |
|||||||||
