Unformatted text preview: t of backtracking. 5 You break ties by choosing the left-most in this order: You (Y), Moose (M), McCain(Mc), Palin (P), Obama (O), Biden (B) Show the partial search tree only up to the first time you try to assign seat 6. Begin with the reduced domains from the previous
page. Use only the constraints supplied; use no commensense beyond what you see in the
constraints. You might want to work this out on the tear off sheet at the end of the quiz first. 1 2 Mc
Y M P 3 4 5 6 6 Part C (15 points)
Now you try to use depth-first search and constraint domains reduced to size 1. propagation through You break ties by choosing the left-most in this order: You (Y), Moose (M), McCain(Mc), Palin (P), Obama (O), Biden (B)
Show the the full search tree (up until you find a solution), starting with the reduced domains.
1 2 same pre- You might want to work this out on a copy at the end of the quiz.. Mc
Y M P 3 4 5 6 7 Part D (10 points)
Obama and Biden hear that you've got a Nintendo Wii, and now both of them want to sit next to
you. Keeping all the other...
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence