| Properties
of heuristic functions |
|
|
|
|
|
|
|
|
|
|
|
|
|
| ¡ | Admissible:
never overestimates cost |
|||||||||||
| ¡ | Consistent: estimated cost from node |
|||||||||||
| n+1
is than cost from node n +
step |
||||||||||||
| cost. |
||||||||||||
| ¡ | A* using
Tree-Search is optimal if the |
|||||||||||
| heuristic used
is |
||||||||||||
| l | Graph-Search
needs an consistent |
|||||||||||
| heuristic. Why? |
||||||||||||
