Choco Constraints Homework

Constraints programming in JAVA using Choco ## Deliverables There is four numbers Each one of them can have the value 1, 2 or 3. Numbers can be increased one and after reaching 3 they come back to 1 again. ex: 1-> 2->3->1->2->3 (as if in mod 4 without zero) from 4 numbers we can increase only 3 of them at the same time. Is there any way to reach the shortest sequence of numbers from a given initial sequence. Or any approach to do it? Example sequence to find 3 1 2 1 from 1 1 1 1 1 1 1 1 -> 1 2 2 2 -> 1 3 3 3 -> 2 3 1 1 -> 3 1 2 1 We can expand this question for N numbers in mod M and K dependency where K For example we have N wheels having numbers on them from 1 to M. They are hang on the wall after rotated randomly. We want to make all of them to be seen same. But we can not rotate them one by one. There should be a dependency. Imagine we are able to rotate K wheels at a time.