Log inSign up

Home / Lectures / Artificial Intelligence

Still from the lecture
Computer Science

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

Course
Artificial Intelligence
Instructor
Patrick H. Winston
Department
Electrical Engineering and Computer Science
Recorded
Fall 2010
Level
Undergraduate
▶ Watch the lecture

Free account required. The lecture opens at MIT OpenCourseWare.

About this lecture

This lecture covers strategies for finding the shortest path. We discuss branch and bound, which can be refined by using an extended list or an admissible heuristic, or both (known as A*). We end with an example where the heuristic must be consistent.

← Lecture 4: Search: Depth-First, Hill Climbing, BeamLecture 6: Search: Games, Minimax, and Alpha-Beta →

More in Computer Science

Still from the lecture “Lecture 1: Algorithmic Thinking, Peak Finding”
Computer Science

Lecture 1: Algorithmic Thinking, Peak Finding

Introduction to Algorithms · Srini Devadas

Still from the lecture “Lecture 2: Models of Computation, Document Distance”
Computer Science

Lecture 2: Models of Computation, Document Distance

Introduction to Algorithms · Erik Demaine

Still from the lecture “Lecture 3: Insertion Sort, Merge Sort”
Computer Science

Lecture 3: Insertion Sort, Merge Sort

Introduction to Algorithms · Srini Devadas