| Comparisons |
|
|
|
|
|
|
|
|
|
|
|
| 1. | UCS: BestFS( g ) |
|||||||||
| • | complete,
optimal, high memory usage |
|||||||||
| 2. | Perfect-Info:
BestFS( gT(n)
+ hT(n) ) |
|||||||||
| • | complete,
optimal, low memory usage |
|||||||||
| 3. | Greedy: BestFS( h ) |
|||||||||
| • | incomplete,
suboptimal, low memory usage |
|||||||||
