Lecture 9

• Lecture 9
  • Video
  • Terminology - Search trees
  • Measuring Performance
  • BFS - Contd
  • DFS
  • Informed Search for Romania problem
    • Greedy best first search

Video

link

Terminology - Search trees

Measuring Performance

BFS - Contd

• it is complete
• complexity?
• say b is brnaching factor and depth is d
  • I will travers number of nodes
    • 1 + b + b^2 + b^3 + .. + b^(d)

DFS

Informed Search for Romania problem

• straight line distance di hai meko

Greedy best first search

• check neighbors, unme se pick greedily, the one with lease sld