If you wanted to find a solution at this point, what variables could the MRV (minimum remaining values) ordering heuristic tell you to assign first ?
You are a scheduling robot assigned to schedule professors and computer science classes that meet M/W/F. There are 5 classes to schedule and 3 professors to teach these classes. Your requirements are:
(1) each professor only teaches one class at a time;
(2) each class is taught by only one professor; and
(3) some professors can only teach some of the classes.
You must produce a complete and consistent schedule. You decide to formulate this task as a CSP in which classes are the variables (named C1 through C5) and professors are the domain values (named A, B, and C). After you have solved the CSP, each class (variable) will be assigned one professor (value), and all constraints will be satisfied. The classes (variables) are:
• C1, Class 1 - Intro to
• C2, Class 2 - Intro to
• C3, Class 3 - Natural Language Processing: meets from 9:00-9:50am
• C4, Class 4 - Computer Vision: meets from 9:00-9:50am
• C5, Class 5 - Machine Learning: meets from 9:30-10:20am
The professors (domain values) are:
• A, Professor A, who is available to teach Classes C3 and C4.
• B, Professor B, who is available to teach Classes C2, C3, C4, and C5.
• C, Professor C, who is available to teach Classes C1, C2, C3, C4, C5.
Answer the following questions:
MRV: If you wanted to find a solution at this point, what variables could the MRV (minimum remaining values) ordering heuristic tell you to assign first ?
Step by step
Solved in 2 steps with 1 images
