- n variables x1, x2...xn.
- Value of x1 is taken from domain D1.
- constraint pk(xk1, xk2...xkj)
- If all constraints are binary then we can draw a graph like above.
- Each variable is assigned an agent. Each agent tries to change its value so as to minimize the constraints it violates.
- This is another instance of the multiagent search problem.