Hi all,
I have a symmetry constraint (think a<b or a>b, whatever)
and I would like to break this symmetry dynamically.
When I break is statically, my engine is way slower.
As far as I understand it, the search procedure makes initial choices that are incompatible with the breaking,
and propagation is not able to find out about this incompatibility.
For this reason, I would like to break it dynamically: let the search procedure explore freely, and post a>b or b>a
for the rest of the search as soon as either of then happens to be true.
Any idea on how to do that technically speaking with oscar.cp?
BTW: any plans for optional tasks in oscar.cp?
Cheers
--
Renaud