Lecture 8: Constraints: Search, Domain Reduction

Om kurset

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