Tree Search 101: DFS

• Depth-first search: stack nodes

• Requires O(d) space and O(bd) time

• Not a good method:

  • Gets ``stuck'' on deep branches
  • Stays ``local'': neighbors of failure also likely to be failures in most search spaces