So, is it constraint network or constraint satisfaction problem?

You are given the constraint network from the previous exercise, so ${\cal C} = \langle V, dom, (R_{uv})\rangle$ with variables $V = \{v_1, v_2, v_3\}$ and domains $dom(v) = \{1, 2, 3, 4, 5\}$ for all $v \in V$.

How many assignments exist for this network?

Given the constraint network from the previous exercise, so ${\cal C} = \langle V, dom, (R_{uv})\rangle$ with variables $V = \{v_1, v_2, v_3\}$, domains $dom(v) = \{1, 2, 3, 4, 5\}$ for all $v \in V$, and constraints $v_1 < v_2$, $v_2 < v_3$. Assume the partial assignment $\alpha = \{v_1 \mapsto 2, v_3 \mapsto 3\}$.

Is $\alpha$ consistent? Can it be extended to a solution?

consistent

not consistent

solvable

not solvable

In the next code block you are supposed to encode the full map-coloring problem of Australia.