Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Informed Search Algorithm Comparison
|
Algorithm
|
Time
|
Space
|
Optimal
|
Complete
|
Derivative
|
|
|
Best First Search
|
O(bm)
|
O(bm)
|
No
|
Yes
|
BFS
|
|
|
Hill Climbing
|
O(∞)
|
O(b)
|
No
|
No
|
|
|
|
A*
|
O(2N)
|
O(bd)
|
Yes
|
Yes
|
Best First Search
|
-
b
, branching factor
d , tree depth of the solution
m , maximum tree depth
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.
