Hi Torsten, it just doesn't support search over sets, so if searching over the integer variables is enough it should work. I have successfully compiled the code with Gecode 4, it requires a few changes but it shouldn't be too difficult if you want to give it a try. We have plans to work a bit more on combinators soon, so I hope we'll get someone to bring all this code up to date.
Cheers, Guido On 9 May 2014, at 8:38 pm, Torsten Anders <torsten.and...@beds.ac.uk> wrote: > Dear Guido, > > I had a look at the search combinators supported by the Gecode FlatZinc > interpreter (http://www.gecode.org/flatzinc.html). I have two brief > questions. > > The README file of http://www.gecode.org/download/searchcombinators-0.9.3.tgz > says that support for set variables will be added later. Does this mean only > that branching strategies for set variables cannot be defined right now, or > more generally that CSPs with set variables are not supported by the current > search combinators? In other words, can I define CSPs with a mix of integer > and set variables, where a branching of the integers will also determine/fix > the set variables? > > Also, do the search combinators depend on Gecode version 3.7.2, or could they > also be compiled with later versions? > > Thank you! > > Best wishes, > Torsten > > -- > Dr Torsten Anders > Course Leader, Music Technology > University of Bedfordshire > Park Square, Room A315 > http://www.torsten-anders.de > > > > > > > > > _______________________________________________ > 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
