-
Currently the next variable is chosen based on number of possible values and how often it failed at that point (`bt_infeasible`)
- [x] ABS
- [ ] Weighted degree heuristic (wdeg)
- [ ] dom / wdeg
…
-
**Is your feature request related to a problem? Please describe.**
When there are a correct number of non-voters and voters, however the `num_replicas` is not matched correctly for constraints, the…
-
All pieces are moveable in the same fashion in the 4 quadrants. Exploit vertical and horizontal symmetries to reduce the search space.
-
Hi choco team,
I hope that you are doing well.
**Is your feature request related to a problem? Please describe.**
Choco provides a convenient expression builder that is then compiled into a s…
-
Hello
I can't seem to get a team deleted from the web module, if a match has been set up and cancelled afterwards. Not sure if this also happens after a completed match.
Sorry, unexpected error:…
-
- The previous chapters focused on solving problems by searching the state space using domain-specific heuristics.
- Each state was treated as a black box with no internal structure, and domain-speci…
-
Never done something like this, but want to give it a go!
Not exactly sure what direction I want to go in yet. Recently I've been very interested in constraint satisfaction problems and things like…
-
Given all the places and dates of visit by user, design an algorithm for finding the optimal itinerary that satisfies these constraints.
-
**Description**
This is not a bug, but a request of clarification.
We are currently working on a possible extension of the package that changes the internal representation of the Constraint to lev…
-
Hi,
I want to start by thanking you for making your source code public and for a well-written paper that I found fairly impressive and novel (especially the constraint value graph modelling)! I wan…