Hi Alberto, That seems to be a problem with reified Boolean linear constraints (which are new in 3.0.0). I'll have a look as soon as I find time.
For the meantime, you could channel the 0/1 variables to integers and then use the integer version... Sorry Christian -- Christian Schulte, www.it.kth.se/~cschulte/ -----Original Message----- From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Alberto Delgado Sent: Monday, March 16, 2009 10:24 AM To: us...@gecode.org Subject: [gecode-users] problem with gecode 3.0 Hi, I'm getting some weird solutions from a problem I'm solving with gecode 3.0 that i don't when i use gecode 2.2. There is a simplified version of the problem where i've isolated the specific situation in the attached files. Basically, what the problem does is to determine whether there is any repeated occurences of a value assigned to a position in a stack below such position. I define an objective variable that is the sum of positions with repeated occurrences below them. When i try to find the best solution some of the reified variables i use are set to 0 in situations where they shoudn't, and the objective variable takes values that don't match the valuation of the solution. prueba.cc is set to be run using gecode 3.0 and prueba2.cc using gecode 2.2. Thanks ind advance for any help/advice. Alberto _______________________________________________ Gecode users mailing list us...@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
