3 ms·

For depth and breadth, I don't think Håkan Kjellerstrand can be beat. (hakank.org) The downside is, you have to do a lot of reading to figure out what's going

For depth and breadth, I don't think Håkan Kjellerstrand can be beat. (hakank.org) The downside is, you have to do a lot of reading to figure out what's going on. The upshot is, it's all in one place. I don't know that there's any great introductory material that will give you a brief comparison between systems -- it may be that solving constraint satisfaction problems is just really hard, and there's no summary that can do it justice.

hakank 8y ago
(Thanks for your kind words.) http://hakank.org/common_cp_models/ http://hakank.org/common_cp_models/ is a page which collects models that solve the same problem in different CP systems (and mostly with the same approach). It can be used to compare similarities and differences between systems, though one have to do the comparison oneself. A long time ago (in 2012) I did a talk on comparing features in different CP systems mostly focused how "easy" - subjectively and IMHO - it was to learn the systems: http://hakank.org/constraint_programming/sweconsnet_talk_20120514.ppt http://hakank.org/constraint_programming/sweconsnet_talk_201...