quiz2_2008

Mccain insists on sitting in seat 1 4 part a 10

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: 10 points) You realize there are 2 ways to represent this problem as a constraint problem. For each below, run the domain reduction algorithm and continue to propagate through domains reduced to one value. That is, cross out all the impossible values in each domain without using any search. Variables: You, Moose, McCain, Palin, Obama, Biden Domains: Seats 1-6 Constraints: I-VII You: 1 2 3 4 5 6 Moose: 1 2 3 4 5 6 McCain: 1 2 3 4 5 6 Palin: 1 2 3 4 5 6 Obama: 1 2 3 4 5 6 Biden: 1 2 3 4 5 6 Variables: Seats 1-6 Domains: You, Moose, McCain, Palin, Obama, Biden Constraints: I-VII 1: You Moose McCain Palin Obama Biden 2: You Moose McCain Palin Obama Biden 3: You Moose McCain Palin Obama Biden 4: You Moose McCain Palin Obama Biden 5: You Moose McCain Palin Obama Biden 6: You Moose McCain Palin Obama Biden Part B (15 points) For now, you decide to continue using seats as variables and guests as domains (the 2nd representation). You decide to see how a depth-first search with no constraint propagation works , but as you run the search you see you are doing a lo...
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