© 2000 Todd Neller.  A.I.M.A. text figures © 1995 Prentice Hall.  Used by permission.
•Time complexity:
–Branching factor b
–Search depth d
–O(b^d)
•Space complexity also O(b^d)
•Same time/space complexity. Which is the more critical limit?
Breadth-First Search (cont.)