14 Apr 2005
CS 3243 - Revision
15
Summary of algorithms
¡Breadth-First – FIFO order
¡Uniform-Cost – in order of cost
¡Depth-First – LIFO order
¡Depth-Limited – DFS to a maximum depth
¡Iterative Deepening – Iterative DLS.
¡Bidirectional – also search from goal towards origin
Yes
Yes
No
No
Yes
Yes
Optimal?
O(bd/2)
O(bd)
O(bl)
O(bm)
O(béC*/eù)
O(bd+1)
Space
O(bd/2)
O(bd)
O(bl)
O(bm)
O(b éC*/eù)
O(bd+1)
Time
Yes
Yes
No
No
Yes
Yes
Complete?
Bidirectional
Iterative
Deepening
Depth
Limited
Limited
Depth
First
First
Uniform
Cost
Cost
Breadth-First
Criterion