Gecode is a portable, accessible, and efficient environment for developing constraint-based systems and applications. Gecode is radically open for programming, meaning that it can be easily interfaced to other systems. It supports the programming of new propagators (as implementation of constraints), branching strategies, and search engines. New variable domains can be programmed at the same level of efficiency as finite domain and integer set variables that come predefined with Gecode.
License: MIT/X Consortium License
Changes:
The interface was cleaned up to use consistent parameter passing, consistent naming, a simpler Gist interface, and namespaces for operator overloading. Functionality was extended so that propagators can be non-monotonic, and branchings support tie-breaking and random variable and value selection. Some features with insufficient quality have been removed: complete set variables and reflection. Usage was simplified by using auto-linking on Windows and more commonly used filename extensions. Important aspects have been optimized, such as memory management, memory usage, and efficiency on 64-bit machines.
More...