05_uninformed_search2013

# N assume solution is at depth d n worst case expand

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: of BFS n༆  n༆  Completeness: q༇  YES Time complexity: q༇  Assume a state space where every state has b successors. n༆  Assume solution is at depth d n༆  Worst case: expand all but the last node at depth d n༆  Total number of nodes expanded: b + b 2 + b 3 + ... + b d + (b d +1 − b) = O(b d +1 ) € 5 9/20/13 Evaluation of BFS n༆  n༆  Uninformed Search Completeness: Time complexity: q༇  q༇  YES Total number of nodes expanded: b + b 2 + b 3 + ... + b d + (b d +1 − b) = O(b d +1 ) n༆  Space complexity: q༇  Lecture 10: 9/20/13 Same, if each node is retained in memory € Evaluation of BFS n༆  Completeness: q༇  n༆  YES Time complexity: q༇  Space complexity: q༇  n༆  € Same, if each node is retained in memory Optimality: q༇  n༆  n༆  Memory requirements are a bigger problem than its execution time. Exponential complexity search problems cannot be solved by uninformed search methods for any but the s...
View Full Document

## This note was uploaded on 02/10/2014 for the course CS 440 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online