5.

9
a: For every block, it has X and O two states, so there are at most 9! Possible state.
b~e:

Problem 2 ‘->’ in the figure shows the result after pruning

6.5

1. Obviously, F = 1
2. now the MRV leads to C2 and C1, choose C2 = 0, which lead to W less than 5
3. now the MRV leads to C1, choose C1 = 0, which lead to O less than 5
4. now the MRV leads to O, as O should be even and less than 5, so O can only be 2 or 4, choose
O=2
5. now T has only one value, so T = 6
6. now R has only one value, so R = 4
7. now W has only one value, so W = 3
8. now U has no solution, go back to 4, choose O = 4
10. now T has only one value, so T = 7
11. now R has only one value, so R = 8
12. now W has 2, 3 to choose, as 2 will lead to U having no solution, so choose W = 3
13. now U has only one value, so U = 6
6.11

1. remove SA-WA from the queue, leads to SA = {B, R}, check every X-SA, no change
2. remove SA-V, leads to SA = B, check every X-SA
3. when checking NT-SA, it leads to NT = {G, R}
4. when checking Q-SA, it leads to Q = {G, R}
5. when checking NSW-SA, it leads to NSW = {G, R}, check over
6. remove NT-WA, leads to NT = R, check every X-NT
7. when checking Q-NT, it leads to Q = G
8. remove NSW-V, leads to NSW = G, check every X-NSW
9. when checking Q-NSW, it leads to Q having no solution