main page modules namespaces classes files
Gecode/J home

Money.java

Go to the documentation of this file.

/* -*- indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Mikael Lagerkvist <lagerkvist@gecode.org>
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Mikael Lagerkvist, 2006
 *     Guido Tack, 2006
 *
 *  Last modified:
 *     $Date: 2007-12-05 14:47:42 +0100 (Wed, 05 Dec 2007) $ by $Author: zayenz $
 *     $Revision: 5594 $
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.org
 *
 *  Permission is hereby granted, free of charge, to any person obtaining
 *  a copy of this software and associated documentation files (the
 *  "Software"), to deal in the Software without restriction, including
 *  without limitation the rights to use, copy, modify, merge, publish,
 *  distribute, sublicense, and/or sell copies of the Software, and to
 *  permit persons to whom the Software is furnished to do so, subject to
 *  the following conditions:
 *
 *  The above copyright notice and this permission notice shall be
 *  included in all copies or substantial portions of the Software.
 *
 *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 */

package examples;

import static org.gecode.Gecode.*;
import static org.gecode.GecodeEnumConstants.*;

import org.gecode.*;

public class Money extends Space {
  public VarArray<IntVar> letters;

  public Money(Options opt) {
    super("Money");

    // We need 8 variables. Each one gets the name 
    // of it's corresponding letter, and an initial domain
    // of [0..9]
    letters = new VarArray<IntVar>(8);
    for (char c: "SENDMORY".toCharArray())
      letters.add(new IntVar(this, ""+c, 0, 9));
       
    // Refer to the letters by name
    IntVar s = letters.get(0);
    IntVar e = letters.get(1);
    IntVar n = letters.get(2);
    IntVar d = letters.get(3);
    IntVar m = letters.get(4);
    IntVar o = letters.get(5);
    IntVar r = letters.get(6);
    IntVar y = letters.get(7);

    // Initial letters are non-zero
    rel(this, s, IRT_NQ, 0, opt.icl); 
    rel(this, m, IRT_NQ, 0, opt.icl);

    // Construct linear system representing the equation...
    if(opt.naive) {
      // ...using coefficient/variable representation of the equation
      int c[] = {           1000,    100,     10,      1,
                            1000,    100,     10,      1,
                            -10000,  -1000,   -100,    -10,     -1};
      VarArray<IntVar> x = 
        new VarArray<IntVar>(s, e, n, d,    m, o, r, e,
                             m, o, n, e, y);
      linear(this, c, x, IRT_EQ, 0, opt.icl);
    } else {
      // ...using dynamic Expr-structures
      post(this,
           new Expr()
           .p(1000, s).p(100, e).p(10, n).p(d)
           .p(1000, m).p(100, o).p(10, r).p(e),
           IRT_EQ,
           new Expr()
           .p(10000, m).p(1000, o).p(100, n).p(10, e).p(y));
    }
    // All letters must have distinct values.
    distinct(this, letters, opt.icl);

    // Find values for the letters using first-fail heuristic
    branch(this, letters, INT_VAR_SIZE_MIN, INT_VAL_MIN);
  }

  public Money(Boolean share, Money money) {
    super(share, money);
    letters = new VarArray<IntVar>(this, share, money.letters);
  }

  public static void main(String[] args) {
    Options opt = new Options("SEND+MORE=MONEY");
    opt.gui = true;
    opt.naive = false;
    opt.icl = ICL_BND;
    opt.parse(args);

    Money money = new Money(opt);
    opt.doSearch(money);
  }
}