Artur

ok,thanks Kris. Best, Artur.

Thank you Kris for fast response. In the attached file a test is written for this example. // all results of selections for this example 1) InputOrderSelect always gets infinite loop or sometimes also throws StackOverFlowError 2) SimpleSelect with MostConstrainedDynamic comparator solves all expressions 3) SimpleSelect with remaining comparators always gets infinite loop or sometimes also throws StackOverFlowError Can you help me to find out what the problem can be here and how I can fix it ? Is...

Hi all. We have the following expression and we use the following Search option: x28 = (x1111 + x1249 + x1250) x1252 = (x31 + x29 + (-1 * x492) + (-1 * x490) + (-1 * x491) + (-1 * x1053) + (-1 * x1061)) x1250 = (x492 + x490 + x491 + x1053 + x1061) DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); search.getSolutionListener().recordSolutions(true); search.setTimeOut(3);</intvar></intvar>...

Hi all. We have the following expression and we use the following Search option: x28 = (x1111 + x1249 + x1250) x1252 = (x31 + x29 + (-1 * x492) + (-1 * x490) + (-1 * x491) + (-1 * x1053) + (-1 * x1061)) x1250 = (x492 + x490 + x491 + x1053 + x1061) DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); search.getSolutionListener().recordSolutions(true); search.setTimeOut(3);</intvar></intvar>...

Hi all We have the list of the following expressions in this sequence: 1)a = (b + c + d) 2)e = (f + g + (-1 * h) + (-1 * j) + (-1 * k) + (-1 * l) + (-1 * m)) 3)d = (h + j + k + l + m) We use intvar type with domain(-100, 100) of JaCop and to get the results of expressions we use the following code. IntVar[] intVars = our vars; DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); boolean labeling...

Hi all We have the list of the following expressions in this sequence: 1)a = (b + c + d) 2)e = (f + g + (-1 * h) + (-1 * j) + (-1 * k) + (-1 * l) + (-1 * m)) 3)d = (h + j + k + l + m) We use intvar type of JaCop and to get the results of expressions we use the following code. IntVar[] intVars = our vars; DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); boolean labeling = search.labeling(store,...

Hi all We have the list of the following expressions in this sequence: 1)a = (b + c + d) 2)e = (f + g + (-1 * h) + (-1 * j) + (-1 * k) + (-1 * l) + (-1 * m)) 3)d = (h + j + k + l + m) We use intvar type of JaCop and to get the results of expressions we use the following code. IntVar[] intVars = our vars; DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); boolean labeling = search.labeling(store,...

Hi all We have the list of the following expressions in this sequence: 1)a = (b + c + d) 2)e = (f + g + (-1 * h) + (-1 * j) + (-1 * k) + (-1 * l) + (-1 * m)) 3)d = (h + j + k + l + m) We use intvar type of JaCop and to get the results of expressions we use the following code. IntVar[] intVars = our vars; DepthFirstSearch<intvar> search = new DepthFirstSearch<>(); SelectChoicePoint<intvar> select = new InputOrderSelect<>( store, intVars, new IndomainRandom<>() ); boolean labeling = search.labeling(store,...