Loading...

What is a constraint satisfaction problem (CSP)?

  • A problem solved when each variable has a value that satisfies all constraints
  • A search problem that requires finding the shortest path in a state space
  • A problem where variables have continuous domains only
  • A problem that can only be solved with deterministic algorithms