8. Constraints: Search, Domain Reduction

MIT Artificial Intelligence, Fall 2010 Instructor: Patrick Winston View the complete course: YouTube Playlist: 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. License: Creative Commons BY-NC-SA More information at More courses at Support OCW at We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at