To Daniel's comment: that's a great idea (I'm sorta new to this whole releasing-a-library thing so I didn't think of that), and I'll definitely make a branch for that if I think of a big idea that I want to implement that involves breaking changes. But I figure that if someone other than me thinks of something like that, we'll probably discuss it a bit and figure something out (rather than just showing up with a pull request).
To Dmitry's comment: I've actually never tried Choco, I essentially chose JaCoP because it occured first in my "Java Constraint Programming" google search. Now I'm seeing that a lot of constraint programmers use Choco, and I'll try it out. I will point out that JaCoP walked away with some bronze and silver medals (with Gecode getting ALL the golds) at the FlatZinc challenge. (Choco didn't compete at all, though.) On Friday, September 13, 2013 12:32:31 AM UTC-7, Dmitry Groshev wrote: > > Great stuff! > > I'm wondering what's the "realworld" difference between JaCoP and CHOCO. > Why did you choose the former? > > On Tuesday, September 10, 2013 5:39:46 AM UTC+4, Alex Engelberg wrote: >> >> http://github.com/aengelberg/clocop >> >> CloCoP is a Clojure wrapper of the Java library JaCoP. The acronyms stand >> for "Clojure/Java Constraint Programming". This invites comparison to the >> core.logic library, and you may wonder why we need both. There are a few >> ways in which, in my opinion, the JaCoP system is better than core.logic: >> >> - JaCoP is more "plug-in-able," with an extensive set of >> customizations to the way that the search operates. There are interfaces >> for different components of the search, and each has several >> implementations. >> - I found that with core.logic, I was somewhat limited by the set of >> available constraints. JaCoP has many different constraints that seem to >> more suit my needs for solving challenging problems. >> - As the core.logic people >> say,<https://github.com/clojure/core.logic/wiki/External-solvers>JaCoP is >> anywhere from 10X-100X faster than core.logic at solving Finite >> Domain problems. >> >> JaCoP has a lot of "global constraints" which are very powerful and >> essential for describing certain problems. As Radoslaw Szymanek (an >> author of JaCoP) says, "CP without global constraints is just [a] plain >> academic toy. Using problems with arithmetic constraints is doing CP bad >> publicity." >> >> If you'd like to see implementations of sample problems in CloCoP, check >> out the test >> cases<https://github.com/aengelberg/clocop/tree/master/test/clocop> >> (https://github.com/aengelberg/clocop/tree/master/test/clocop). >> > -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
