Depth limited search - HiIAmTzeKean/SC3000-Artificial-Intelligence GitHub Wiki

tags:

  • 🌱
  • AI
  • ComputerScience
  • Search date: 18--Apr--2023

Depth limited search

Extension of Depth first search where infinite search is prevented. Note this also works in cases with cycles where the search will be cut and algorithm recovers from the cycle.

Cost

  • Complete
    • Only if the cut-off $L \ge d$
  • Optimality
    • Cannot guarantee that the first depth path is the shortest path
  • Time
    • $O(b^L)$
  • Space
    • $O(b^L)$

Links:

⚠️ **GitHub.com Fallback** ⚠️