## 8. Constraints: Search, Domain Reduction

MIT 6.034 Artificial Intelligence, Fall 2010

View the complete course: http://ocw.mit.edu/6-034F10

Instructor: Patrick Winston

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 http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

MIT 6.034 Artificial Intelligence, Fall 2010

View the complete course: http://ocw.mit.edu/6-034F10

Instructor: Patrick Winston

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 http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

How annoying is the person sleeping. Every lesson he/she is disrespectful in so many ways.

Seriously if you keep up with the lectures they just get better and better. I can feel my brain beating. 😀

the number of students decreased significantly after line drawing lecture lol

why these students late for this awesome class?

Being a former Arizonan, hearing him mistake New Mexico for the Grand Canyon State was painful.

I love these. This prof. is

succinctand good examples17:55 the guy with the red jacked on the end of the 2nd row is sound asleep like a baby XD XD

Dude , why sit on the 2nd row???

What do we check when we consider assignments ?

Or we'll let this program give the class seizures. at 1:30

Why don't we use binary search to find # planes…

Anyone have a link to the exam method of managing constraint propagation that is mentioned in the video?

anyone knows the link for the simulation he runs at the beginning of the lecture?

why does he use only capital letters? this slows him down.

why do not just arrange the flights in order and check the maximum number of overlapping flights at a time to get the minimum amount of required plane?

I tried to test the demonstrations.jnlp file at home using javaws under Linux (Debian stretch). It seems that I have some permission problems. I get f.e. the following line in the terminal:

java.security.AccessControlException: access denied ("java.io.FilePermission" "/usr/bin/xprop" "execute")

Has anybody a suggestion to cure this?

What a brilliant lecture series …

This is so awesome

Does anyone know what it says between propagation options and resource planning? It looks kinda like ORERING EFFECTS, so I'm guessing it says ordering effects. It would be helpful if someone can identify it.

I'm pretty sure that every time he said "Arizona," he meant to say "New Mexico."

I have to be honest, the 'Assignmet' typo was grating on me.

since the values are discrete, couldn't it be that the minimum amount of planes needed is 5. And 3 and 4 are both on the impossible side of the time-to-calculate bulge?

Why is the Domain (D) a bag of values rather than a set of values?

Learn about color mapping and resource allocation manager. Surprisingly they are same problem. Nice. 😀

Martial Arts in #AI. Some #AIkido for constraints. Use your enemies powers against him. #LearnAIforFun