Hi Luca, No, really anything useful to say here. It should be possible and due to the documentation it should be easier to do than before but it would mean that you really program your own search engine.
What might help you, though, is the support we added in 4.2.1 for nogood literals. Sorry for not being more helpful. Cheers Christian -- Christian Schulte, Professor of Computer Science, KTH, www.ict.kth.se/~cschulte/ -----Original Message----- From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Luca Di Gaspero Sent: Saturday, March 01, 2014 9:23 AM To: <users@gecode.org> Subject: [gecode-users] Backjumping (aka Intelligent Backtracking) Hi all, I am wondering wether it is currently* possible to implement some backjumping strategy on top of the gecode dfs/bab mechanism (possibly involving Restart Based engine). Any hint? Thanks in advance for your answers. Luca * I read an ancient negative answer to this question in the ML, but now the gecode tools are more powerful _______________________________________________ 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
