This preview shows page 1. Sign up to view the full content.
Unformatted text preview: s by drawing one line for each such
pairwise constraint. Suggestion: arrange all your nodes in a circle.
1 3 4 5 6 7 10 2 8 9 A2 (9 points)
Thinking that constraints 1-4 can serve as a good starting point to solve any puzzle, and remembering
that oracle has spoken, so all pieces are provided in the correct orientation, Martin decides to use
the constraints to simplify the starting domains for each of the piece locations. Describe the domains
for A, B, C after the initial constraints have been applied. 10 high 20 wide Piece Location A
C 11 Description of pieces in
the domain Size of domain Part B: Checking Neighbors (8 points)
While solving the puzzle, Martin places piece A in location 1. He is running the Domain Reduction
Algorithm using forward checking. The domain of location 2 is shown as it was before A was placed. Domain of location 2 before placement of A : Again, noting that no rotation is allowed, and that, all protrusions fit successfully into all concavities in
spite of our limited drawing skills, what happens after he places piece A and why? 12 Part C: Neighbors of Neighbors (27 points)
C1 (5 points)
Nearing completion of the puzzle, Martin encounters a cluster of 4 empty piece locations. (there are 4
other empty spaces elsewhere). He still has a total of 8 pieces. Considering only constraints imposed by
the neighbors of the 4 empty piece locations shown, fill in the domain table for each of the piece
locations. Once again note that all pieces are shown in the only orientation allowed,...
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence