Ujhelyi Zoltan wrote:
Hello,
If I am correct, the result is caused by the fact that Gecode
calculates all the possible solutions, and in your case they are in
the form of result. If you say, none of them can be equal, it can
happen both by the array element 1 to be 0 or 1; your constraint does
not allow Gecode to reduce the domains.
Gecode does not calculate all possible solutions, it rather tries to
remove all impossible values, and sometimes cannot remove enything.
That's why you have search. In Jorge's case, the branching will make
sure that all variables are either set to 0 or 1 during search.
Cheers,
Guido
_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users
