I guess under certain conditions the code that posts the constraints (not the
actual propagator) can be stronger than ICL_DEF, in which case this can happen.
If it's not too complicated, could you send us a concrete example?
Cheers,
Guido
--
Guido Tack
On 23/08/2012, at 12:08, Max Ostrowski <ostro...@cs.uni-potsdam.de> wrote:
> Can the order of propagation influence the final result?
>
>
> Given a list of reified constraints L posted with ICL_DEF
>
> for (i in L)
> {
> i == true;
> status();
> }
>
> // the space is failed
>
> Now the same thing with the list sorted by some order
>
> randomize_order(L)
> for (i in L)
> {
> i == true;
> status();
> }
>
> // the space not failed
>
>
>
> Can this happen (not using circuit and nvalues) only usign linear
> constraints.
> Why does this happen.
>
>
> Best,
> Max
>
>
> _______________________________________________
> Gecode users mailing list
> users@gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
