Information

Deadline Geen deadline
Submission limit No limitation

Sign in

[Module1 Theory] TinyCSP


Question 1: N-Queens model

For the \(N\)-Queens problem, how would you recommend that the positions of the queens are modelled?

Question 2: CP - complete approach

Constraint Programming is a complete solving technology. A technology that is complete:

Question 3: CP - declarative

Constraint Programming is declarative. Declarative means that:

Question 4: TinyCSP - Fix point

In TinyCSP.java, the fix-point computation:

Question 5: TinyCSP - domain implementation

In TinyCSP, the implementation of the domain of a variable uses:

Question 6: TinyCSP - Backtracking

In TinyCSP, when backtracking: