3.6 Depth First Search (Revisited)


  • Modest memory requirements as only one path needs to be stored (Assuming no check for duplicates)

  • If branching factor is b and maximum depth is m

  • bm nodes need to be stored

  • Time complexity is O(bm)

  • Can be faster than BFS

  • BUT

  • Might not recover from a bad early choice in a large / infinite search space

  • Might not find the shortest/optimal path


[MAIN PAGE] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999. Department of Computer Science, RMIT University.
Last Modified: 20th June, 1999.