Heuristic Search (05)
Michael L. Littman
January 28th, 1999
ADMINISTRATION
Programming Project
Battleship Files
Walksat Instructions
Tableau Instructions
OPTIMIZATION
Plan
MAXSAT
Preference CSPs
Simple Example
Maximizing vs. Satisficing
Being the Best
Preference CSPs
More Formally
Heuristic Search
Path Problems
Breadth-first Search
Dijkstra's Algorithm
Dijkstra Example
Why It Works
Negative Costs
Better Optimistic Estimate
A* Search
A* Facts
Generating Good Heuristics: 8-Puzzle
Missionaries and Cannibals
HOMEWORK
Homework 1
Next:
ADMINISTRATION
