Hakan Kjellerstrand

Thanks for looking into this, Ole. And I agree that there should be a dedicated scheduling constraint. :-) However, I don't understand your comment: "It's not immediately obvious that the...

@Wikunia Yes, you have a good point and I will test this as well. (My formulation is one of the most used decompositions in the CP folk lore.)

`"max_solutions"=>2` works great if it means that the solver tries to find "all solutions" but it stops after the second solution. For my particular use case (Sudoku): I want the...

Here's my thoughts about this. On the first question, the main rule is that `max_solutions` should be 1 as default. And that would give that `all_solutions=true`(without `max_solutions` flag) should then...

You have a good point: Using only one flag (`max_solutions`) might be better and solve the weird overlap problem. I suggest that the default value should be 1. This would...

> I'll focus on the element constraints for not but this should be fairly easy to add I think. For now you might want to solve it using the TableConstraint...

FYI: Here's a simple decomposition using `TableConstraint`, but I think the creation of the table can be a little better with some more thoughts. I'll test it with some proper...

OK. Is it the same with quadratic constraints?

That's great. That would help for at least some of these non-linear constraints.

Here's a simple (perhaps too simple) example of a `modulo` decomposition using - what I now call - `fd_dom(v)`which returns the domains of a variable as a list of integers....