Unformatted text preview: Variable
4 13 Domain C2 (10 points)
Once again noting that all pieces are shown in the only orientation allowed, complete this section of the
puzzle using depth-first search with forward checking and propagation through singleton
domains. Again assume that, all protrusions fit successfully into all concavities.
Assinging the variables, 1, 2, 3, 4, in numerical order, draw the search tree that is evaluated using
forward checking with singleton propagation. Be sure to try assignments in lexicographic order.
Work carefully, because we will award points only for the fraction of the search done right, so
early mistakes will be worse that late mistakes or not completing the search. 1 2 3 4 14 C3 (4 points)
What is the final solution to this region of the puzzle? Variable Value 1
C4 (3 points)
List the partial paths in your tree where constraint checking fails. C5 (5 points)
Looking at your answer to C1, how might we adjust the search to find solutions with less backtracking? 15 Blank page 16 Tear off sheet, you need not hand this in
Problem 1, Part B, Left Side 17 Tear off sheet, you need not hand this in
Problem 2, Part B 18 Tear off sheet, you need not hand this in Problem 1, Part B, Right Side 19 Blank, final page 20...
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence