ClassroomThe classroom
Back to the lesson libraryMECHANISM · 13 MIN
M05.8 CONNECT THE MECHANISM

Improve a candidate without exploring every path

Fix a clashing school timetable one move at a time, get stuck where every move looks worse, and escape by borrowing a trick from cooling metal.

LESSON OVERVIEW13 min lesson

Lesson overview

Fix a clashing school timetable one move at a time, get stuck where every move looks worse, and escape by borrowing a trick from cooling metal.

What you’ll explore

  • Local search changes a current candidate using an objective and neighborhood; restarts, annealing, and constraint handling trade search effort against solution quality.
GO TO THE SOURCE

Original explanations, connected to the research.

Artificial Intelligence: A Modern Approach — authors’ materialsOptimization by Simulated Annealing (Kirkpatrick, Gelatt & Vecchi, 1983)
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.