{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

4_SP10 cs188 lecture 3 -- a-star search (2PP)

4_SP10 cs188 lecture 3 -- a-star search (2PP) - N O b m O...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
4 Iterative Deepening Iterative deepening uses DFS as a subroutine: 1. Do a DFS which only searches for paths of length 1 or less. 2. If “1” failed, do a DFS which only searches paths of length 2 or less. 3. If “2” failed, do a DFS which only searches paths of length 3 or less. ….and so on. Algorithm Complete Optimal Time Space DFS w/ Path Checking BFS ID Y
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: N O( b m ) O( bm ) Y N* O( b s+1 ) O( b s+1 ) Y N* O( b s ) O( bs ) … b Costs on Actions Notice that BFS finds the shortest path in terms of number of transitions. It does not find the least-cost path. We will quickly cover an algorithm which does find the least-cost path. START GOAL d b p q c e h a f r 2 9 2 8 1 8 2 3 1 4 4 15 1 3 2 2...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online