Lecture 10

• Lecture 10
  • Video
  • Performance
  • States vs Nodes
  • Informed Search
    • greedy BFS
    • A* Search
  • Admissible Heuristics
  • Consistent Heuristics
  • Optimality of A*
  • Properties of A*

Video

link

Performance

States vs Nodes

• bfs me best case = 2nd level pe first node is my node
• dekhlio ki time me what r u considering, nodes generated or nodes expanded
  • generated me -b lunga, expanded me b

Informed Search

greedy BFS

• avoid repeating states

• optimal nahi bcz all path dekhe hi nahi na

A* Search

• cost already spent + estimated cost further
• basically total estimated cost ko 2 me tod dia
• Romania ka straight line distance wale pe A*
  • 
  • Arad se start kia
  • initially fn = 366 = 0+366
  • 
  • I pick Sibiu
  • 
  • 
  • 

Admissible Heuristics

Consistent Heuristics

Optimality of A*

Properties of A*