Lecture 3 - Uninformed Search II

The document discusses several uninformed search strategies for solving problems by searching state spaces. It describes breadth-first search, uniform-cost search, depth-first search, depth-limited search, and iterative deepening search. For each strategy, it covers properties like completeness, time complexity, space complexity, and optimality. It also provides examples and analysis of depth-first search and iterative deepening search. Finally, it introduces the concept of bidirectional search, which simultaneously searches forward from the starting state and backward from the goal state.

Uploaded by

sheikh sayeed

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPT, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

119 views39 pages

Lecture 3 - Uninformed Search II

Uploaded by

sheikh sayeed

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPT, PDF, TXT or read online on Scribd

You are on page 1/ 39

Solving problems by searching

Chapter 3

3/4/2020 CS 3243 - Blind Search 1

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 ∞)


3/4/2020 CS 3243 - Blind Search 2

Uninformed search strategies
 Uninformed search strategies use only the information available in the problem
definition
 Breadth-first search
 Uniform-cost search
 Depth-first search
 Depth-limited search
 Iterative deepening search

3/4/2020 CS 3243 - Blind Search 3

Breadth-first search
 Expand shallowest unexpanded node
 Implementation:
 USE is a FIFO queue, i.e., new successors go at
end


3/4/2020 CS 3243 - Blind Search 4

Breadth-first search
 Expand shallowest unexpanded node


 Implementation:
 fringe is a FIFO queue, i.e., new successors go
at end


3/4/2020 CS 3243 - Blind Search 5

Breadth-first search
 Expand shallowest unexpanded node


 Implementation:
 fringe is a FIFO queue, i.e., new successors go
at end


3/4/2020 CS 3243 - Blind Search 6

Breadth-first search
 Expand shallowest unexpanded node


 Implementation:
 fringe is a FIFO queue, i.e., new successors go at end

3/4/2020 CS 3243 - Blind Search 7

Properties of breadth-first search
 Complete? Yes (if b is finite)
 Time? 1+b+b2+b3+… +bd + b(bd-1) = O(bd+1)
 Space? O(bd+1) (keeps every node in memory)
 Optimal? Yes (if cost = 1 per step)
 Space is the bigger problem (more than time)

3/4/2020 CS 3243 - Blind Search 8

Uniform Cost Search
3/4/2020 CS 3243 - Blind Search 10
Optimality of Uniform Cost Search?
 Assume that every step costs at least e > 0

 Proof of Completeness:
Given that every step will cost more than 0, and assuming a finite branching factor, there is a
finite number of expansions required before the total path cost is equal to the path cost of the
goal state. Hence, we will reach it in a finite number of steps.

 Proof of Optimality given Completeness:

 Assume UCS is not optimal.
 Then there must be a goal state with path cost smaller than the goal state which was found
(invoking completeness)
 However, this is impossible because UCS would have expanded that node first by definition.
 Contradiction.
Complexity of Uniform Cost
 Let C* be the cost of the optimal solution

 Assume that every step costs at least e > 0

 Worst-case time and space complexity is:

O( b [1 + floor(C*/e)] )

Why?
floor(C*/e) ~ depth of solution if all costs are
approximately equal
Uniform-cost search
 Expand least-cost unexpanded node
 Implementation:
queue ordered by path cost
 Equivalent to breadth-first if step costs all equal
 Complete? Yes, if step cost ≥ ε
 Time? # of nodes with g ≤ cost of optimal solution, O(b ceiling(C*/ ε))
where C* is the cost of the optimal solution
 Space? #of nodes with g ≤ cost of optimal solution, O(bceiling(C*/ ε))
 Optimal? Yes – nodes expanded in increasing order of g(n)

3/4/2020 CS 3243 - Blind Search 13

Depth-first search
 Expand deepest unexpanded node
 Implementation:
LIFO queue, i.e., put successors at front

3/4/2020 CS 3243 - Blind Search 14

Depth-first search
 Expand deepest unexpanded nodeLIFO queue, i.e.,
put successors at front

3/4/2020 CS 3243 - Blind Search 15

Depth-first search
 Expand deepest unexpanded node
 Implementation:
LIFO queue, i.e., put successors at front