7 finally you decide that you will be happy if and

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: oth Curie and Pythagoras. (Yes, even if you belong to one or more of the groups above.) 8 Part A (5 points) That's a lot of preferences to keep track of, so you decide to draw a diagram to help make sense of it all. Draw a line between the initials of each pair of guests who must not share the same time slot. This diagram is repeated on the tear off sheet. 9 Part B (15 points) You decide to first assign the time slots (which conveniently happen to be 1, 2, 3, and 4 pm) by using a depth-first search with no constraint propagation. The only check is to be sure each new assignment violates no constraint with any previous assignment. As a tiebreaker, assign a lecturer to the earliest available time slot (so as to get them back to their own historical eras as soon as possible). In the tree below, Alan Turing has already been scheduled to speak at 1 pm, in accordance with constraint #1. Continue filling in the search tree up to the first time you try (and fail) to assign a time slot to Isaac Newton, at which point you give up in frustration and move on to Part C in search of a more sophisticated approach. T L 1 1 2 3 4 B C S P N 10 Part C (20 points) You're not fond of backtracking, so...
View Full Document

This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.

Ask a homework question - tutors are online