Catalog · Artificial Intelligence Lecture 5 of 30 Lecture 5: Search: Optimal, Branch and Bound, A* ← Previous Lecture 4: Search: Depth-First, Hill Climbing, Beam Next → Lecture 6: Search: Games, Minimax, and Alpha-Beta ✓ Mark complete Materials Transcript (PDF) ↗ transcript