Could someone direct me to a more detailed explanation of the redundant constraints shown in the Chapter 7 exercises of the Constraint Programming Tutorial (i.e. "Finite Domain Constraint Programming in Oz. A Tutorial.", section 7.4).
The problem has to do with "Magic Sequences," and the redundant constraints are:
x0 + x1 + ... + x(n-1) = n
-1*x0 + 0*x1 + 2*x2 + ... + (n-2)*x(n-1) = 0
The explanations in the tutorial are a bit vague.
Thanks.
-- Harmon
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
