•Why do we use depth-first search?
– Dfs uses less memory than bfs in general
•O(d) v.s. O(b^d)
– Has low overhead to manage nodes
•C.f. A* needs priority queue, IDA* just needs stack
–Can behave like bfs with TT
•C.f. IDA* and A*, SSS* and MT-SSS*,Seo and AO*