Lecture 25: Advanced Search (Optimization)

Content locked

The catalog is public. Reading this content requires approved access.

Introduction

Search vs. Optimization

Example Problems

n Queens Problem

Traveling Salesman Problem (TSP)

Boolean Satisfiability (SAT)

Hill Climbing

Basic Concept

Defining Neighbors

Neighborhood Tradeoffs

Algorithm

Local Optima Problem

Escaping Local Optima

Random Restarts

Stochastic Hill Climbing

Other Variations

Simulated Annealing

Concept

Algorithm

Acceptance Probability

Cooling Schedule

Genetic Algorithms

Biological Inspiration

Terminology

Setup

Algorithm

Proportional Selection

Example: Course Scheduling

Variations and Challenges

Practice Problems

Key Takeaways