1.4k views
2 votes
In a CSP (Constraint Satisfaction Problem), consider a map coloring example for a part of the USA. Here are the constraints. No two neighboring states can have the same color. The only colors available are red, blue, yellow, green, orange, purple, black and white. You are not allowed to mix colors (e.g. you cannot make grey using black \& white). We have the following information on neighboring states for a part of the map.

TX is bordered by NM, OK, AR, LA
NM is bordered by TX, AZ, CO, OK
OK is bordered by TX, AR, NM, CO, KS
LA is bordered by TX, AR, MS
Which of the following is NOT acceptable in a valid (partial) solution of this CSP?
a. TX =purple, NM= orange, OK =green, AR =black, LA = white
b. TX= white, NM= blue, OK, green, AR= purple, LA= brown
c. TX = blue, NM = red, OK = green, AR = yellow, LA = white
d. TX= red, NM= blue. OK= yellow, AR= black, LA = white

User Stania
by
7.3k points

1 Answer

4 votes

Final answer:

In a valid solution to the map coloring CSP, neighboring states cannot have the same color. Option b is not acceptable because neighboring states TX and NM have different colors.

Step-by-step explanation:

For a valid solution to the map coloring CSP, no two neighboring states can have the same color. Looking at the given options, we find that option b. TX= white, NM= blue, OK, green, AR= purple, LA= brown is NOT acceptable. This is because TX and NM are neighboring states, and in this option, they both have different colors. The other options all follow the given constraints of the problem.

User David Guida
by
8.3k points