ClassroomThe classroom
Back to the lesson libraryMECHANISM · 14 MIN
M05.2 CONNECT THE MECHANISM

Choose an order for exploring possibilities

Four ways to pick the next route from a waiting list. Race them across the town map and see why the fewest roads isn't the shortest drive.

LESSON OVERVIEW14 min lesson

Lesson overview

Four ways to pick the next route from a waiting list. Race them across the town map and see why the fewest roads isn't the shortest drive.

What you’ll explore

  • Breadth-first, depth-first, uniform-cost, and iterative-deepening search prioritize candidates differently, producing different cost, memory, and completeness properties.
GO TO THE SOURCE

Original explanations, connected to the research.

Artificial Intelligence: A Modern Approach — authors’ materials
Suggest a correction

A precise note can make an explanation better.

Choose the scene and describe what needs attention. Download a feedback file to share through a channel you already use. This page does not send feedback or connect you with a reviewer.

The file includes this note, the scene title, and lesson metadata. Your saved progress and quiz responses are excluded. Download before leaving or reloading to keep your note.