org.chocosolver.samples.integer.Alpha Maven / Gradle / Ivy

Go to download
/**
 * 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:
 * 
 

 * Attribute a value to each letter, such that the equations are correct.
 * 
 * 

 *
 * @author Charles Prud'homme
 * @since 02/08/11
 */
public class Alpha extends AbstractProblem {

    IntVar[] letters;

    @Override
    public void createSolver() {
        solver = new Solver("Alpha");
    }

    @Override
    public void buildModel() {
        letters = new IntVar[26];
        for (int i = 0; i < 26; i++) {
            letters[i] = VariableFactory.bounded("" + (char) (97 + i), 1, 26, solver);
        }
        solver.post(IntConstraintFactory.sum(extract("ballet"), VariableFactory.fixed(45, solver)));
        solver.post(IntConstraintFactory.sum(extract("cello"), VariableFactory.fixed(43, solver)));
        solver.post(IntConstraintFactory.sum(extract("concert"), VariableFactory.fixed(74, solver)));
        solver.post(IntConstraintFactory.sum(extract("flute"), VariableFactory.fixed(30, solver)));
        solver.post(IntConstraintFactory.sum(extract("fugue"), VariableFactory.fixed(50, solver)));
        solver.post(IntConstraintFactory.sum(extract("glee"), VariableFactory.fixed(66, solver)));
        solver.post(IntConstraintFactory.sum(extract("jazz"), VariableFactory.fixed(58, solver)));
        solver.post(IntConstraintFactory.sum(extract("lyre"), VariableFactory.fixed(47, solver)));
        solver.post(IntConstraintFactory.sum(extract("oboe"), VariableFactory.fixed(53, solver)));
        solver.post(IntConstraintFactory.sum(extract("opera"), VariableFactory.fixed(65, solver)));
        solver.post(IntConstraintFactory.sum(extract("polka"), VariableFactory.fixed(59, solver)));
        solver.post(IntConstraintFactory.sum(extract("quartet"), VariableFactory.fixed(50, solver)));
        solver.post(IntConstraintFactory.sum(extract("saxophone"), VariableFactory.fixed(134, solver)));
        solver.post(IntConstraintFactory.sum(extract("scale"), VariableFactory.fixed(51, solver)));
        solver.post(IntConstraintFactory.sum(extract("solo"), VariableFactory.fixed(37, solver)));
        solver.post(IntConstraintFactory.sum(extract("song"), VariableFactory.fixed(61, solver)));
        solver.post(IntConstraintFactory.sum(extract("soprano"), VariableFactory.fixed(82, solver)));
        solver.post(IntConstraintFactory.sum(extract("theme"), VariableFactory.fixed(72, solver)));
        solver.post(IntConstraintFactory.sum(extract("violin"), VariableFactory.fixed(100, solver)));
        solver.post(IntConstraintFactory.sum(extract("waltz"), VariableFactory.fixed(34, solver)));
        solver.post(IntConstraintFactory.alldifferent(letters, "BC"));
    }

    private IntVar[] extract(String word) {
        IntVar[] ivars = new IntVar[word.length()];
        for (int i = 0; i < word.length(); i++) {
            ivars[i] = letters[word.charAt(i) - 97];
        }
        return ivars;
    }

    @Override
    public void configureSearch() {
        solver.set(IntStrategyFactory.minDom_LB(letters));
    }

    @Override
    public void solve() {
        solver.findSolution();
    }

    @Override
    public void prettyOut() {
        StringBuilder st = new StringBuilder("Alpha\n");
        st.append("\t");
        for (int i = 0; i < 26; i++) {
            st.append(letters[i].getName()).append("= ").append(letters[i].getValue()).append(" ");
            if (i % 6 == 5) {
                st.append("\n\t");
            }
        }
        st.append("\n");
        System.out.println(st.toString());
    }

    public static void main(String[] args) {
        new Alpha().execute(args);
    }
}