/**
* Copyright (c) 1999-2014, Ecole des Mines de Nantes
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the Ecole des Mines de Nantes nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* Created by IntelliJ IDEA.
* User: Jean-Guillaume Fages
* Date: 18/09/13
* Time: 23:10
*/
package samples.integer;
import samples.MasterProblem;
import samples.ParallelizedProblem;
import solver.constraints.IntConstraintFactory;
import solver.search.strategy.ISF;
import solver.variables.IntVar;
import solver.variables.VariableFactory;
import util.tools.StringUtils;
public class CostasPara extends ParallelizedProblem {
private static int n = 12;
IntVar[] vars, vectors;
public CostasPara(int searchIdx){
super(searchIdx);
}
@Override
public void buildModel() {
vars = VariableFactory.enumeratedArray("v", n, 0, n - 1, solver);
vectors = new IntVar[n * n - n];
int idx = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
IntVar k = VariableFactory.bounded(StringUtils.randomName(),-20000,20000,solver);
solver.post(IntConstraintFactory.sum(new IntVar[]{vars[i], k}, vars[j]));
vectors[idx] = VariableFactory.offset(k, 2 * n * (j - i));
idx++;
}
}
}
solver.post(IntConstraintFactory.alldifferent(vars, "AC"));
solver.post(IntConstraintFactory.alldifferent(vectors, "BC"));
}
@Override
public void configureSearch() {
switch (searchIdx){
case 0:
solver.set(ISF.lexico_LB(vars));
break;
case 1:
solver.set(ISF.minDom_LB(vars));
break;
default:
solver.set(ISF.activity(vars, 0));
}
}
@Override
public void solve() {
solver.findSolution();
}
@Override
public void prettyOut() {
String s = "";
for (int i = 0; i < n; i++) {
s += "|";
for (int j = 0; j < n; j++) {
if (j == vars[i].getValue()) {
s += "x|";
} else {
s += "-|";
}
}
s += "\n";
}
System.out.println(s);
}
public static void main(String[] args){
new MasterProblem(CostasPara.class.getCanonicalName(),3);
}
}