this repo has no description
dekker.one
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <gecode/driver.hh>
35
36#include <gecode/int.hh>
37#include <gecode/minimodel.hh>
38
39using namespace Gecode;
40
41/**
42 * \brief %Example: %Alpha puzzle
43 *
44 * Well-known cryptoarithmetic puzzle of unknown origin.
45 *
46 * \ingroup Example
47 *
48 */
49class Alpha : public Script {
50protected:
51 /// Alphabet has 26 letters
52 static const int n = 26;
53 /// Array for letters
54 IntVarArray le;
55public:
56 /// Branching to use for model
57 enum {
58 BRANCH_NONE, ///< Choose variable left to right
59 BRANCH_INVERSE, ///< Choose variable right to left
60 BRANCH_SIZE ///< Choose variable with smallest size
61 };
62 /// Actual model
63 Alpha(const Options& opt)
64 : Script(opt), le(*this,n,1,n) {
65 IntVar
66 a(le[ 0]), b(le[ 1]), c(le[ 2]), e(le[ 4]), f(le[ 5]),
67 g(le[ 6]), h(le[ 7]), i(le[ 8]), j(le[ 9]), k(le[10]),
68 l(le[11]), m(le[12]), n(le[13]), o(le[14]), p(le[15]),
69 q(le[16]), r(le[17]), s(le[18]), t(le[19]), u(le[20]),
70 v(le[21]), w(le[22]), x(le[23]), y(le[24]), z(le[25]);
71
72 rel(*this, b+a+l+l+e+t == 45, opt.ipl());
73 rel(*this, c+e+l+l+o == 43, opt.ipl());
74 rel(*this, c+o+n+c+e+r+t == 74, opt.ipl());
75 rel(*this, f+l+u+t+e == 30, opt.ipl());
76 rel(*this, f+u+g+u+e == 50, opt.ipl());
77 rel(*this, g+l+e+e == 66, opt.ipl());
78 rel(*this, j+a+z+z == 58, opt.ipl());
79 rel(*this, l+y+r+e == 47, opt.ipl());
80 rel(*this, o+b+o+e == 53, opt.ipl());
81 rel(*this, o+p+e+r+a == 65, opt.ipl());
82 rel(*this, p+o+l+k+a == 59, opt.ipl());
83 rel(*this, q+u+a+r+t+e+t == 50, opt.ipl());
84 rel(*this, s+a+x+o+p+h+o+n+e == 134, opt.ipl());
85 rel(*this, s+c+a+l+e == 51, opt.ipl());
86 rel(*this, s+o+l+o == 37, opt.ipl());
87 rel(*this, s+o+n+g == 61, opt.ipl());
88 rel(*this, s+o+p+r+a+n+o == 82, opt.ipl());
89 rel(*this, t+h+e+m+e == 72, opt.ipl());
90 rel(*this, v+i+o+l+i+n == 100, opt.ipl());
91 rel(*this, w+a+l+t+z == 34, opt.ipl());
92
93 distinct(*this, le, opt.ipl());
94
95 switch (opt.branching()) {
96 case BRANCH_NONE:
97 branch(*this, le, INT_VAR_NONE(), INT_VAL_MIN());
98 break;
99 case BRANCH_INVERSE:
100 branch(*this, le.slice(le.size()-1,-1), INT_VAR_NONE(), INT_VAL_MIN());
101 break;
102 case BRANCH_SIZE:
103 branch(*this, le, INT_VAR_SIZE_MIN(), INT_VAL_MIN());
104 break;
105 }
106 }
107
108 /// Constructor for cloning \a s
109 Alpha(Alpha& s) : Script(s) {
110 le.update(*this, s.le);
111 }
112 /// Copy during cloning
113 virtual Space*
114 copy(void) {
115 return new Alpha(*this);
116 }
117 /// Print solution
118 virtual void
119 print(std::ostream& os) const {
120 os << "\t";
121 for (int i = 0; i < n; i++) {
122 os << ((char) (i+'a')) << '=' << le[i] << ((i<n-1)?", ":"\n");
123 if ((i+1) % 8 == 0)
124 os << std::endl << "\t";
125 }
126 os << std::endl;
127 }
128};
129
130/** \brief Main-function
131 * \relates Alpha
132 */
133int
134main(int argc, char* argv[]) {
135 Options opt("Alpha");
136 opt.solutions(0);
137 opt.iterations(10);
138 opt.branching(Alpha::BRANCH_NONE);
139 opt.branching(Alpha::BRANCH_NONE, "none");
140 opt.branching(Alpha::BRANCH_INVERSE, "inverse");
141 opt.branching(Alpha::BRANCH_SIZE, "size");
142 opt.parse(argc,argv);
143 Script::run<Alpha,DFS,Options>(opt);
144 return 0;
145}
146
147// STATISTICS: example-any
148