Constraint Satisfaction Quiz

Before you start

Quiz for Lab 03: Constraint Satisfaction Problems. Answer every task, then press Check answers at the bottom: each answer is marked, the explanations appear, and you get a score per skill.

Assumptions unless stated otherwise

• Domains show the values that are currently still possible.
• Backtracking tries variables and values in the stated order.
• For map-colouring tasks, adjacent regions must have different colours.
• N-Queens: queenPosition[col] = row; on an \(n \times n\) board the positive diagonal index is row + col, the negative diagonal index is n − 1 − row + col, and there are \(2n - 1\) diagonals in each direction.

How answers are scored

• Sequences: click the nodes of the tree in order (or type the letters into the highlighted box). A sequence scores only if it is exactly right.
• Numbers: type the value; a decimal point or comma both work.
• Rows: one choice per row; each correct row earns its share of the points.
• Select all that apply: scores only when the selection is exactly right.
• Your answers are saved in this browser only, so you can leave and come back. Nothing is sent anywhere.