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: Best-First Search
- Special case of breadth-first search
- Uses h(n) = heuristic function as its evaluation function
- Ignores cost so far to get to that node (g(n))
- Expand the node that appears closest to goal
- Best First Search is complete
- Best First Search is not optimal
- A solution can be found in a longer path (higher h(n) with a lower g(n) value)
- Special cases:
- uniform cost search: f(n) = g(n) = path to n
- A* search
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.