gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/examples/domino.cc

@@ -0,0 +1,297 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Mikael Lagerkvist <lagerkvist@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2006
+ *     Mikael Lagerkvist, 2006
+ *
+ *  Last modified:
+ *     $Date: 2008-08-21 15:20:13 +0200 (Thu, 21 Aug 2008) $ by $Author: schulte $
+ *     $Revision: 7674 $
+ *
+ *  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.
+ *
+ */
+
+#include "examples/support.hh"
+#include "gecode/minimodel.hh"
+
+namespace {
+
+  /** \brief Board specifications
+   *
+   * \relates Domino
+   */
+  extern const int *specs[];
+  /** \brief Number of board specifications
+   *
+   * \relates Domino
+   */
+  extern const unsigned int n_examples;
+
+}
+
+/**
+ * \brief %Example: Solitaire Domino
+ * 
+ * The task is to place domino pieces on a board. Each piece covers two 
+ * fields and has two numbers. There are 28 pieces, from 0-0 to 6-6.
+ * The board is set up with a number in each field that must match the
+ * number of the domino piece placed on that field.
+ *
+ * \ingroup ExProblem
+ *
+ */
+class Domino : public Example {
+private:
+  /// Specification of the board
+  const int *spec;
+  /// Width of the board
+  int width;
+  /// Height of the board
+  int height;
+  
+  /// The board representing the number of the piece at each position
+  IntVarArray x;
+
+public:
+  /// Actual model
+  Domino(const SizeOptions& opt)
+    : spec(specs[opt.size()]), 
+      width(spec[0]), height(spec[1]),
+      x(this, (width+1)*height, 0, 28) {
+    spec+=2; // skip board size information
+    
+    // Copy spec information to the board
+    IntArgs board((width+1)*height);
+    for (int i=0; i<width; i++)
+      for (int j=0; j<height; j++)
+        board[j*(width+1)+i] = spec[j*width+i];    
+    
+    // Initialize the separator column in the board
+    for (int i=0; i<height; i++) {
+      board[i*(width+1)+8] = -1;
+      post(this, x[i*(width+1)+8]==28);
+    }
+
+    // Variables representing the coordinates of the first
+    // and second half of a domino piece
+    IntVarArray p1(this, 28, 0, (width+1)*height-1);
+    IntVarArray p2(this, 28, 0, (width+1)*height-1);
+    
+
+    int dominoCount = 0;
+      
+    int possibleDiffsA[] = {1, width+1};
+    IntSet possibleDiffs(possibleDiffsA, 2);
+    
+    for (int i=0; i<=6; i++)
+      for (int j=i; j<=6; j++) {
+        
+        // The two coordinates must be adjacent.
+        // I.e., they may differ by 1 or by the width.
+        // The separator column makes sure that a field
+        // at the right border is not adjacent to the first field
+        // in the next row.
+        IntVar diff(this, possibleDiffs);
+        abs(this, minus(this, p1[dominoCount], p2[dominoCount]),
+            diff, ICL_DOM);
+        
+        // If the piece is symmetrical, order the locations
+        if (i == j)
+          rel(this, p1[dominoCount], IRT_LE, p2[dominoCount]);
+        
+        // Link the current piece to the board
+        element(this, board, p1[dominoCount], i);
+        element(this, board, p2[dominoCount], j);
+        
+        // Link the current piece to the array where its
+        // number is stored.
+        element(this, x, p1[dominoCount], dominoCount);
+        element(this, x, p2[dominoCount], dominoCount);
+        dominoCount++;
+      }
+
+    // Branch by piece
+    IntVarArgs ps(28*2);
+    for (int i=0; i<28; i++) {
+      ps[2*i]   = p1[i];
+      ps[2*i+1] = p2[i];
+    }
+
+    // Install branchings
+    branch(this, ps, INT_VAR_NONE, INT_VAL_MIN);
+  }
+
+  /// Print solution
+  virtual void
+  print(std::ostream& os) {
+    for (int h = 0; h < height; ++h) {
+      os << "\t";
+      for (int w = 0; w < width; ++w) {
+        int val =  x[h*(width+1)+w].min();
+        char c = val < 10 ? '0'+val : 'A' + (val-10);
+        os << c;
+      }
+      os << std::endl;
+    }
+    os << std::endl;
+  }
+  /// Constructor for cloning \a s
+  Domino(bool share, Domino& s) :
+    Example(share,s), spec(s.spec), width(s.width), height(s.height) {
+      x.update(this, share, s.x);
+  }
+  /// Copy space during cloning
+  virtual Space*
+  copy(bool share) {
+    return new Domino(share,*this);
+  }
+
+};
+
+
+/** \brief Main-function
+ *  \relates Domino
+ */
+int
+main(int argc, char* argv[]) {
+  SizeOptions opt("Domino");
+  opt.size(0);
+  opt.parse(argc,argv);
+  if (opt.size() >= n_examples) {
+    std::cerr << "Error: size must be between 0 and "
+	      << n_examples-1 << std::endl;
+    return 1;
+  }
+  Example::run<Domino,DFS,SizeOptions>(opt);
+  return 0;
+}
+
+
+namespace {
+
+  /** \name Puzzle specifications
+   *
+   * \relates Domino
+   */
+  //@{
+  
+  /// %Example 0
+  const int domino0[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      2,1,0,3,0,4,5,5,
+      6,2,0,6,3,1,4,0,
+      3,2,3,6,2,5,4,3,
+      5,4,5,1,1,2,1,2,
+      0,0,1,5,0,5,4,4,
+      4,6,2,1,3,6,6,1,
+      4,2,0,6,5,3,3,6
+    };
+  
+  /// %Example 1
+  const int domino1[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      5,1,2,4,6,2,0,5,
+      6,6,4,3,5,0,1,5,
+      2,0,4,0,4,0,5,0,
+      6,1,3,6,3,5,4,3,
+      3,1,0,1,2,2,1,4,
+      3,6,6,2,4,0,5,4,
+      1,3,6,1,2,3,5,2
+    };
+  
+  /// %Example 2
+  const int domino2[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      4,4,5,4,0,3,6,5,
+      1,6,0,1,5,3,4,1,
+      2,6,2,2,5,3,6,0,
+      1,3,0,6,4,4,2,3,
+      3,5,5,2,4,2,2,1,
+      2,1,3,3,5,6,6,1,
+      5,1,6,0,0,0,4,0
+    };
+  
+  /// %Example 3
+  const int domino3[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      3,0,2,3,3,4,4,3,
+      6,5,3,4,2,0,2,1,
+      6,5,1,2,3,0,2,0,
+      4,5,4,1,6,6,2,5,
+      4,3,6,1,0,4,5,5,
+      1,3,2,5,6,0,0,1,
+      0,5,4,6,2,1,6,1
+    };
+  
+  /// %Example 4
+  const int domino4[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      4,1,5,2,4,4,6,2,
+      2,5,6,1,4,6,0,2,
+      6,5,1,1,0,1,4,3,
+      6,2,1,1,3,2,0,6,
+      3,6,3,3,5,5,0,5,
+      3,0,1,0,0,5,4,3,
+      3,2,4,5,4,2,6,0
+    };
+  
+  /// %Example 5
+  const int domino5[] =
+    { // width*height of the board
+      8,7,
+      // the board itself
+      4,1,2,1,0,2,4,4,
+      5,5,6,6,0,4,6,3,
+      6,0,5,1,1,0,5,3,
+      3,4,2,2,0,3,1,2,
+      3,6,5,6,1,2,3,2,
+      2,5,0,6,6,3,3,5,
+      4,1,0,0,4,1,4,5
+    };
+  
+  /// List of specifications
+  const int *specs[] =
+    {domino0,domino1,domino2,domino3,domino4,domino5};
+  /// Number of specifications
+  const unsigned n_examples = sizeof(specs)/sizeof(int*);
+  //@}
+
+}
+
+// STATISTICS: example-any

data/ext/gecode-2.2.0/examples/donald.cc

@@ -0,0 +1,107 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2001
+ *
+ *  Last modified:
+ *     $Date: 2007-11-30 13:58:34 +0100 (Fri, 30 Nov 2007) $ by $Author: tack $
+ *     $Revision: 5524 $
+ *
+ *  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.
+ *
+ */
+
+#include "examples/support.hh"
+#include "gecode/minimodel.hh"
+
+/**
+ * \brief %Example: DONALD+GERALD=ROBERT puzzle
+ *
+ * Well-known cryptoarithmetic puzzle of unknown origin.
+ *
+ * \ingroup ExProblem
+ *
+ */
+class Donald : public Example {
+private:
+  /// Number of letters
+  static const int nl = 10;
+  /// Array of letters
+  IntVarArray le;
+public:
+  /// Actual model
+  Donald(const Options& opt) :
+    le(this,nl,0,9) {
+    IntVar
+      d(le[0]), o(le[1]), n(le[2]), a(le[3]), l(le[4]),
+      g(le[5]), e(le[6]), r(le[7]), b(le[8]), t(le[9]);
+    rel(this, d, IRT_NQ, 0);
+    rel(this, g, IRT_NQ, 0);
+    rel(this, r, IRT_NQ, 0);
+
+    post(this,    100000*d+10000*o+1000*n+100*a+10*l+d
+                + 100000*g+10000*e+1000*r+100*a+10*l+d
+               == 100000*r+10000*o+1000*b+100*e+10*r+t,
+         opt.icl());
+
+    distinct(this, le, opt.icl());
+
+    branch(this, le, INT_VAR_SIZE_MIN, INT_VAL_MIN);
+  }
+  /// Constructor for cloning \a s
+  Donald(bool share, Donald& s) : Example(share,s) {
+    le.update(this, share, s.le);
+  }
+  /// Copy during cloning
+  virtual Space*
+  copy(bool share) {
+    return new Donald(share,*this);
+  }
+  /// Print solution
+  virtual void
+  print(std::ostream& os) {
+    os << "\t" << le << std::endl;;
+  }
+
+};
+
+
+/** \brief Main-function
+ *  \relates Donald
+ */
+int
+main(int argc, char* argv[]) {
+  Options opt("Donald+Gerald=Robert");
+  opt.solutions(0);
+  opt.iterations(1500);
+  opt.parse(argc,argv);
+  Example::run<Donald,DFS,Options>(opt);
+  return 0;
+}
+
+// STATISTICS: example-any
+

data/ext/gecode-2.2.0/examples/eq20.cc

@@ -0,0 +1,125 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2001
+ *
+ *  Last modified:
+ *     $Date: 2007-11-30 13:58:34 +0100 (Fri, 30 Nov 2007) $ by $Author: tack $
+ *     $Revision: 5524 $
+ *
+ *  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.
+ *
+ */
+
+#include "examples/support.hh"
+
+/**
+ * \brief %Example: Solving 20 linear equations
+ *
+ * Standard benchmark for solving linear equations.
+ *
+ * \ingroup ExProblem
+ *
+ */
+class Eq20 : public Example {
+private:
+  /// Number of variables
+  static const int x_n = 7;
+  /// Number of equations
+  static const int e_n = 20;
+  /// Variables
+  IntVarArray x;
+public:
+  /// The actual problem
+  Eq20(const Options& opt)
+    : x(this,x_n,0,10) {
+    // Coefficients and constants for the equations
+    int eqs[e_n][x_n+1] = {
+      {876370, -16105, 62397, -6704, 43340, 95100, -68610, 58301},
+      {533909, 51637, 67761, 95951, 3834, -96722, 59190, 15280},
+      {915683, 1671, -34121, 10763, 80609, 42532, 93520, -33488},
+      {129768, 71202, -11119, 73017, -38875, -14413, -29234, 72370},
+      {752447, 8874, -58412, 73947, 17147, 62335, 16005, 8632},
+      {90614, 85268, 54180, -18810, -48219, 6013, 78169, -79785},
+      {1198280, -45086, 51830, -4578, 96120, 21231, 97919, 65651},
+      {18465, -64919, 80460, 90840, -59624, -75542, 25145, -47935},
+      {1503588, -43277, 43525, 92298, 58630, 92590, -9372, -60227},
+      {1244857, -16835, 47385, 97715, -12640, 69028, 76212, -81102},
+      {1410723, -60301, 31227, 93951, 73889, 81526, -72702, 68026},
+      {25334, 94016, -82071, 35961, 66597, -30705, -44404, -38304},
+      {277271, -67456, 84750, -51553, 21239, 81675, -99395, -4254},
+      {249912, -85698, 29958, 57308, 48789, -78219, 4657, 34539},
+      {373854, 85176, -95332, -1268, 57898, 15883, 50547, 83287},
+      {740061, -10343, 87758, -11782, 19346, 70072, -36991, 44529},
+      {146074, 49149, 52871, -7132, 56728, -33576, -49530, -62089},
+      {251591, -60113, 29475, 34421, -76870, 62646, 29278, -15212},
+      {22167, 87059, -29101, -5513, -21219, 22128, 7276, 57308},
+      {821228, -76706, 98205, 23445, 67921, 24111, -48614, -41906}
+    };
+    // Post equation constraints
+    for (int i = e_n; i--; ) {
+      IntArgs c(7,eqs[i][1],eqs[i][2],eqs[i][3],eqs[i][4],
+                eqs[i][5],eqs[i][6],eqs[i][7]);
+      linear(this, c, x, IRT_EQ, eqs[i][0], opt.icl());
+    }
+    branch(this, x, INT_VAR_NONE, INT_VAL_MIN);
+  }
+
+  /// Constructor for cloning \a s
+  Eq20(bool share, Eq20& s) : Example(share,s) {
+    x.update(this, share, s.x);
+  }
+  /// Perform copying during cloning
+  virtual Space*
+  copy(bool share) {
+    return new Eq20(share,*this);
+  }
+  /// Print solution
+  virtual void
+  print(std::ostream& os) {
+    os << "\tx[] = " << x << std::endl;
+  }
+
+};
+
+/** \brief Main-function
+ *  \relates Eq20
+ */
+int
+main(int argc, char* argv[]) {
+  Options opt("Eq20");
+  opt.solutions(0);
+  opt.iterations(1000);
+  opt.parse(argc,argv);
+  Example::run<Eq20,DFS,Options>(opt);
+  return 0;
+}
+
+
+
+// STATISTICS: example-any
+