05_uninformed_search2013

Depth first search dfs expand deepest unexpanded node

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: on costs at least ε Worst-case: 1+!C*/ ε # " $ O(b n༆  n༆  Optimality: q༇  q༇  q༇  Depth First Search (DFS) Expand deepest unexpanded node A B C ) Space complexity: Same as time complexity nodes expanded in order of increasing path cost. YES, if complete. Depth First Search (DFS) Expand deepest unexpanded node D A C B E Algorithm is specialization of those on pg. 77, 82 & 88 in R&N 3rd edition, see pp. 72 & 83 in 2nd 7 9/20/13 Depth First Search (DFS) Expand deepest unexpanded node Depth First Search (DFS) Expand deepest unexpanded node A B C D E I H K Depth First Search (DFS) Expand deepest unexpanded node C B E I K F G Expand deepest unexpanded node A C B D E K G F J I H L L Depth First Search (DFS) A D H C B D I H A L 8 9/20/13 Depth First Search (DFS) Expand deepest unexpanded node A C B D E K G F Expand deepest unexpanded node A C B D J I H Depth First Search (DFS) K G F J I H L E L Implementation: frontier is a stack (LIFO) DFS evaluation...
View Full Document

Ask a homework question - tutors are online