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.

Search Methods

  • A search method is defined by picking the order of node expansion
  • Strategies are evaluated along the following dimensions:
    • completeness: does it always find a solution if one exists?
    • time complexity: number of nodes generated
    • space complexity: maximum number of nodes in memory
    • optimality: does it always find the shortest path solution?
  • Time and space complexity are measured in terms of
    • b: maximum branching factor of the search tree
    • d: depth of the shortest path solution
    • m: maximum depth of the state space (may be ∞)

Speaker notes:

Content Tools


There are currently no sources for this slide.