I want to distribute the work of a cp solver algorithm (or other deterministic Algorithms) in a simple way instead of looking for ways to break apart each specific problem into smaller ones.
Is it possible to execute the cp solver with a given number of threads (E.g., 64) and then have 8 different solvers run the same problem with a specific subset of 8 branches?
In this way I could distribute the solving of the problem in a generic way and then just check choose the best result returned.