Lecture 4: Search: Depth-First, Hill Climbing, Beam

Name: Lecture 4: Search: Depth-First, Hill Climbing, Beam
Uploaded: 2014-01-10T19:41:05Z
Duration: 48 min 42 s
Description: Description: 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. Instructor: Patrick H. Winston

48:42

Up Next

Lecture 5: Search: Optimal, Branch and Bound, A*

Continue

Description: 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.

Instructor: Patrick H. Winston