6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
|
|
|
Next: Bidirectional Search Previous: Examples
Analysis
Repeat some work, but repeated work is only fraction of work on last (unrepeated) level
![\([1] \;+\; [1+b] \;+\; [1+b+b^2] \;+\; \cdots \;+\; [1+b+b^2+ \ldots +b^d]\)](IMG23.PNG){kind=small}
Repeated work is approximately 
of total work (negligible)
Least-length solution but not least-cost solution
Is there a better way to decide thresholds? Yes!
IDA* search (Like A* search but we avoid the space issues with A* by running it iteratively - more later)
