Home / Lectures / Artificial Intelligence

Computer Science
Lecture 4: Search: Depth-First, Hill Climbing, Beam
- Course
- Artificial Intelligence
- Instructor
- Patrick H. Winston
- Department
- Electrical Engineering and Computer Science
- Recorded
- Fall 2010
- Level
- Undergraduate
Free account required. The lecture opens at MIT OpenCourseWare.
About this lecture
This lecture covers algorithms for depth-first and breadth-first search, followed by several refinements: keeping track of nodes already considered, hill climbing, and beam search. We end with a brief discussion of commonsense vs. reflective knowledge.
← Lecture 3: Reasoning: Goal Trees and Rule-Based Expert SystemsLecture 5: Search: Optimal, Branch and Bound, A* →
More in Computer Science

Computer Science
Lecture 1: Algorithmic Thinking, Peak Finding
Introduction to Algorithms · Srini Devadas

Computer Science
Lecture 2: Models of Computation, Document Distance
Introduction to Algorithms · Erik Demaine

Computer Science
Lecture 3: Insertion Sort, Merge Sort
Introduction to Algorithms · Srini Devadas