G'Day,
Please excuse the newbie question - I am trying to learn as fast as I can!
I have a set with 52 elements that I need sorted according to various
rules. One of those rules is that the distance between any two of the
first 10 elements should be at least 2.
I have been trying to figure out the algorithm to run this to no avail.
Short of writing 66 {FD.distance ....} propagators can anyone suggest a
better way?
Thanks in advance.
Cheers
Jeffery
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
