CS 381K: Midterm Study Guide Exam Date: Monday, October 29, 2007, in class. Reading: Russell & Norvig, Chapters 3-9. Topics Covered in Class: State Space Search: definition of State Space; breadth-first, depth-first, bounded depth-first searches: algorithms, comparisons, advantages, disadvantages; iterative deepening; uniform-cost search; heuristic search: functions f, g, h and their meanings ... to an optimal search, and the first solution found may not be an optimal one. 4. Depth-First Iterative-Deepening A search algorithm which suffers neither the drawbacks of breadth-first nor depth-first search on trees is depth-first iterative-deepening (DFID). The al-
Used freightliner m2 flatbed for sale
Silk road url
In each iteration of Iterative-Deepening Search, we have a limit and we traverse the graph using the DFS approach, however, for each step of each iteration, we just need to keep track of only nodes inside the path from the root to depth d. That's the saving in memory. For example, look at the last row of the picture below.