X hits on this document

Powerpoint document

Lecture 2: Problem Solving using State Space Representations - page 46 / 49

166 views

0 shares

0 downloads

0 comments

46 / 49

Slide Set 2: State-Space Search 46

ICS 271, Fall 2007: Professor Padhraic Smyth

Search Strategies

A search strategy 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 a least-cost solution?

Time and space complexity are measured in terms of

b: maximum branching factor of the search tree

d: depth of the least-cost solution

m: maximum depth of the state space (may be ∞)

Document info
Document views166
Page views166
Page last viewedSat Jan 21 18:12:02 UTC 2017
Pages49
Paragraphs815
Words3134

Comments