• Breadth-first state space search
  • Pro: Optimal
  • Con: Memory inefficient (O(b^d))
• Depth-first state space search
  • Pro: Memory efficient (O(bd))
  • Con: Non-optimal

We will describe a search method that exploits knowledge of the problem domain.