Generated on Sat Oct 24 2015 23:19:51 for Gecode by doxygen 1.8.9.1
grocery.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2001
8  *
9  * Last modified:
10  * $Date: 2015-03-17 16:09:39 +0100 (Tue, 17 Mar 2015) $ by $Author: schulte $
11  * $Revision: 14447 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/driver.hh>
39 #include <gecode/int.hh>
40 #include <gecode/minimodel.hh>
41 
42 using namespace Gecode;
43 
60 class Grocery : public Script {
61 protected:
65  static const int s = 711;
67  static const int p = 711 * 100 * 100 * 100;
68 public:
70  Grocery(const Options& opt)
71  : Script(opt), abcd(*this,4,0,s) {
72  IntVar a(abcd[0]), b(abcd[1]), c(abcd[2]), d(abcd[3]);
73 
74  // The sum of all variables is s
75  rel(*this, a+b+c+d == s, opt.icl());
76 
77  // The product of all variables is s (corrected by scale factor)
78  rel(*this, (a*b)*(c*d) == p, opt.icl());
79 
80  // Break symmetries: order the variables
81  rel(*this, abcd, IRT_LQ);
82 
83  branch(*this, abcd, INT_VAR_NONE(), INT_VAL_SPLIT_MAX());
84  }
85 
87  Grocery(bool share, Grocery& s) : Script(share,s) {
88  abcd.update(*this, share, s.abcd);
89  }
90 
92  virtual Space*
93  copy(bool share) {
94  return new Grocery(share,*this);
95  }
96 
98  virtual void
99  print(std::ostream& os) const {
100  os << "\t" << abcd << std::endl;
101  }
102 };
103 
107 int
108 main(int argc, char* argv[]) {
109  Options opt("Grocery");
110  opt.iterations(20);
111  opt.parse(argc,argv);
112  Script::run<Grocery,DFS,Options>(opt);
113  return 0;
114 }
115 
116 // STATISTICS: example-any
117 
Example: Grocery puzzle
Definition: grocery.cpp:60
IntVarBranch INT_VAR_NONE(void)
Select first unassigned variable.
Definition: var.hpp:108
Less or equal ( )
Definition: int.hh:906
Integer variable array.
Definition: int.hh:741
Computation spaces.
Definition: core.hpp:1362
Parametric base-class for scripts.
Definition: driver.hh:633
void iterations(unsigned int i)
Set default number of iterations.
Definition: options.hpp:403
virtual Space * copy(bool share)
Copy during cloning.
Definition: grocery.cpp:93
Gecode::IntSet d(v, 7)
Grocery(const Options &opt)
The actual model.
Definition: grocery.cpp:70
void update(Space &, bool share, VarArray< Var > &a)
Update array to be a clone of array a.
Definition: array.hpp:1072
Gecode::FloatVal c(-8, 8)
int main(int argc, char *argv[])
Main-function.
Definition: grocery.cpp:108
IntVarArray abcd
The price of each item.
Definition: grocery.cpp:63
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Options opt
The options.
Definition: test.cpp:101
IntValBranch INT_VAL_SPLIT_MAX(void)
Select values greater than mean of smallest and largest value.
Definition: val.hpp:93
struct Gecode::@519::NNF::@60::@62 a
For atomic nodes.
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
Definition: options.cpp:331
struct Gecode::@519::NNF::@60::@61 b
For binary nodes (and, or, eqv)
Integer variables.
Definition: int.hh:350
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition: rel.cpp:47
Grocery(bool share, Grocery &s)
Constructor for cloning s.
Definition: grocery.cpp:87
virtual void print(std::ostream &os) const
Print solution.
Definition: grocery.cpp:99
Gecode toplevel namespace
BrancherHandle branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf, FloatVarValPrint vvp)
Branch over x with variable selection vars and value selection vals.
Definition: branch.cpp:43
Options for scripts
Definition: driver.hh:326
void icl(IntConLevel i)
Set default integer consistency level.
Definition: options.hpp:194