Lecture Videos
Lecture 8: Constraints: Search, Domain Reduction
Description: This lecture covers map coloring and related scheduling problems. We develop pseudocode for the domain reduction algorithm and consider how much constraint propagation is most efficient, and whether to start with the most or least constrained variables.
Instructor: Patrick H. Winston
Course Info
Instructor
Departments
As Taught In
Fall
2010
Level
Topics
Learning Resource Types
grading
Exams
Instructor Insights
theaters
Lecture Videos
theaters
Problem-solving Videos
assignment
Programming Assignments
