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.

Further Uninformed Search Strategies

  • Depth-limited search (DLS) : Impose a cut-off (e.g. n for searching a path of length n -1), expand nodes with max. depth first until cut-off depth is reached (LIFO strategy, since it is a variation of depth-first search).

  • Bidirectional search (BIDI) : forward search from initial state & backward search from goal state, stop when the two searches meet. Average effort O(b d/2 ) if testing whether the search fronts intersect has constant effort

  • In AI, the problem graph is typically not known. If the graph is known, to find all optimal paths in a graph with labelled arcs, standard graph algorithms can be used

Speaker notes:

Content Tools


There are currently no sources for this slide.