14 Jan 2004
CS 3243 - Blind Search
56
Summary
nProblem
formulation usually requires abstracting away real-world details to define a state space that can feasibly
be explored
nVariety
of uninformed search strategies
nIterative
deepening search uses only linear space and not much more time than other uninformed algorithms