Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/**
* Copyright (c) 2015, 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the .
* 4. Neither the name of the 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 ''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 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.
*/
package org.chocosolver.samples.integer;
import org.chocosolver.samples.AbstractProblem;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.constraints.IntConstraintFactory;
import org.chocosolver.solver.search.strategy.IntStrategyFactory;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.variables.VariableFactory;
/**
* A verbal arithmetic puzzle:
*
* D O N A L D
* + G E R A L D
* ========
* R O B E R T
*
* Attribute a different value to each letter, such that the equation is correct.
*
* @author Charles Prud'homme
* @since 03/08/11
*/
public class Donald extends AbstractProblem {
IntVar d, o, n, a, l, g, e, r, b, t;
IntVar[] letters;
@Override
public void createSolver() {
solver = new Solver("Donald");
}
@Override
public void buildModel() {
d = VariableFactory.bounded("d", 1, 9, solver);
o = VariableFactory.bounded("o", 0, 9, solver);
n = VariableFactory.bounded("n", 0, 9, solver);
a = VariableFactory.bounded("a", 0, 9, solver);
l = VariableFactory.bounded("l", 0, 9, solver);
g = VariableFactory.bounded("g", 1, 9, solver);
e = VariableFactory.bounded("e", 0, 9, solver);
r = VariableFactory.bounded("r", 1, 9, solver);
b = VariableFactory.bounded("b", 0, 9, solver);
t = VariableFactory.bounded("t", 0, 9, solver);
letters = new IntVar[]{d, o, n, a, l, g, e, r, b, t};
solver.post(IntConstraintFactory.alldifferent(letters, "BC"));
solver.post(IntConstraintFactory.scalar(new IntVar[]{d, o, n, a, l, d,
g, e, r, a, l, d,
r, o, b, e, r, t}, new int[]{100000, 10000, 1000, 100, 10, 1,
100000, 10000, 1000, 100, 10, 1,
-100000, -10000, -1000, -100, -10, -1,
}, VariableFactory.fixed(0, solver)));
}
@Override
public void configureSearch() {
solver.set(IntStrategyFactory.minDom_UB(letters));
}
@Override
public void solve() {
solver.findSolution();
}
@Override
public void prettyOut() {
System.out.println("donald + gerald = robert ");
StringBuilder st = new StringBuilder();
st.append("\t");
for (int i = 0; i < letters.length; i++) {
st.append(String.format("%s : %d\n\t", letters[i].getName(), letters[i].getValue()));
}
System.out.println(st.toString());
}
public static void main(String[] args) {
new Donald().execute(args);
}
}
