package samples; /**
 *  Copyright (c) 1999-2011, 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.
 */

import org.slf4j.LoggerFactory;
import solver.Solver;
import solver.constraints.Arithmetic;
import solver.constraints.nary.Sum;
import solver.constraints.nary.alldifferent.AllDifferent;
import solver.search.loop.monitors.cpviz.Visualization;
import solver.search.loop.monitors.cpviz.visualizers.Vector;
import solver.variables.IntVar;
import solver.variables.VariableFactory;


/**
 * <b>The famous SEND + MORE = MONEY problem.</b></br>
 * The Send More Money Problem consists in finding distinct digits for the letters D, E, M, N, O, R, S, Y
 * such that S and M are different from zero (no leading zeros) and the equation SEND + MORE = MONEY is satisfied.
 *
 * @version 2.0.1</br>
 */
public class SendMoreMoney extends AbstractProblem {

    IntVar S, E, N, D, M, O, R, Y;
    IntVar[] ALL;
    Solver solver;

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

    @Override
    public void buildModel() {
        solver = new Solver();

        S = VariableFactory.enumerated("S", 0, 9, solver);
        E = VariableFactory.enumerated("E", 0, 9, solver);
        N = VariableFactory.enumerated("N", 0, 9, solver);
        D = VariableFactory.enumerated("D", 0, 9, solver);
        M = VariableFactory.enumerated("M", 0, 9, solver);
        O = VariableFactory.enumerated("0", 0, 9, solver);
        R = VariableFactory.enumerated("R", 0, 9, solver);
        Y = VariableFactory.enumerated("Y", 0, 9, solver);

        solver.post(new Arithmetic(S, "!=", 0, solver));
        solver.post(new Arithmetic(M, "!=", 0, solver));
        solver.post(new AllDifferent(new IntVar[]{S, E, N, D, M, O, R, Y}, solver));


        ALL = new IntVar[]{
                S, E, N, D,
                M, O, R, E,
                M, O, N, E, Y};
        int[] COEFFS = new int[]{
                1000, 100, 10, 1,
                1000, 100, 10, 1,
                -10000, -1000, -100, -10, -1
        };
        solver.post(Sum.eq(ALL, COEFFS, 0, solver));
    }

    @Override
    public void configureSearch() {
    }

    @Override
    public void configureEngine() {
    }

    @Override
    public void solve() {
        //-------> Visualization declaration starts here <-------//
        // create a new instance of Visualization
        Visualization visu = new Visualization("SendMoreMoney", solver, "/Users/cprudhom/");
        visu.createTree(); // declare tree search visualization
        visu.createViz(); // declare visualizers container
        // create a new Vector visualizer
        Vector visualizer = new Vector(new IntVar[]{S, E, N, D, M, O, R, Y},
                "expanded", 0, 0, 8, 10, "SENDMORY", 0, 9);
        // add the vector to the visualizers container
        visu.addVisualizer(visualizer);
        //-------> Visualization declaration ends here <-------//
        solver.getSearchLoop().plugSearchMonitor(visu);
        solver.solve();
    }

    @Override
    public void prettyOut() {
        LoggerFactory.getLogger("bench").info("SEND + MORE = MONEY ");
        StringBuilder st = new StringBuilder();
        st.append("\t");
        for (int i = 0; i < ALL.length; i++) {
            st.append(String.format("%s : %d\n\t", ALL[i].getName(), ALL[i].getValue()));
        }
        LoggerFactory.getLogger("bench").info(st.toString());
    }

    public static void main(String[] args) {
        SendMoreMoney smm = new SendMoreMoney();
        smm.buildModel();
        smm.solve();
    }

}

@@ -3989,26 +3989,38 @@
 er, 
-%22/Users/cprudhom/%22
+System.getProperty(%22user.dir%22)
 );%0A 
@@ -4419,130 +4419,8 @@
 r);%0A
-        //-------%3E Visualization declaration ends here %3C-------//%0A        solver.getSearchLoop().plugSearchMonitor(visu);%0A
     

Unplug Visu