alpha.cpp
Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2001 00008 * 00009 * Last modified: 00010 * $Date: 2010-05-08 12:56:03 +0200 (Sat, 08 May 2010) $ by $Author: tack $ 00011 * $Revision: 10906 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/driver.hh> 00039 00040 #include <gecode/int.hh> 00041 #include <gecode/minimodel.hh> 00042 00043 using namespace Gecode; 00044 00053 class Alpha : public Script { 00054 protected: 00056 static const int n = 26; 00058 IntVarArray le; 00059 public: 00061 enum { 00062 BRANCH_NONE, 00063 BRANCH_INVERSE, 00064 BRANCH_SIZE 00065 }; 00067 Alpha(const Options& opt) : le(*this,n,1,n) { 00068 IntVar 00069 a(le[ 0]), b(le[ 1]), c(le[ 2]), e(le[ 4]), f(le[ 5]), 00070 g(le[ 6]), h(le[ 7]), i(le[ 8]), j(le[ 9]), k(le[10]), 00071 l(le[11]), m(le[12]), n(le[13]), o(le[14]), p(le[15]), 00072 q(le[16]), r(le[17]), s(le[18]), t(le[19]), u(le[20]), 00073 v(le[21]), w(le[22]), x(le[23]), y(le[24]), z(le[25]); 00074 00075 rel(*this, b+a+l+l+e+t == 45, opt.icl()); 00076 rel(*this, c+e+l+l+o == 43, opt.icl()); 00077 rel(*this, c+o+n+c+e+r+t == 74, opt.icl()); 00078 rel(*this, f+l+u+t+e == 30, opt.icl()); 00079 rel(*this, f+u+g+u+e == 50, opt.icl()); 00080 rel(*this, g+l+e+e == 66, opt.icl()); 00081 rel(*this, j+a+z+z == 58, opt.icl()); 00082 rel(*this, l+y+r+e == 47, opt.icl()); 00083 rel(*this, o+b+o+e == 53, opt.icl()); 00084 rel(*this, o+p+e+r+a == 65, opt.icl()); 00085 rel(*this, p+o+l+k+a == 59, opt.icl()); 00086 rel(*this, q+u+a+r+t+e+t == 50, opt.icl()); 00087 rel(*this, s+a+x+o+p+h+o+n+e == 134, opt.icl()); 00088 rel(*this, s+c+a+l+e == 51, opt.icl()); 00089 rel(*this, s+o+l+o == 37, opt.icl()); 00090 rel(*this, s+o+n+g == 61, opt.icl()); 00091 rel(*this, s+o+p+r+a+n+o == 82, opt.icl()); 00092 rel(*this, t+h+e+m+e == 72, opt.icl()); 00093 rel(*this, v+i+o+l+i+n == 100, opt.icl()); 00094 rel(*this, w+a+l+t+z == 34, opt.icl()); 00095 00096 distinct(*this, le, opt.icl()); 00097 00098 switch (opt.branching()) { 00099 case BRANCH_NONE: 00100 branch(*this, le, INT_VAR_NONE, INT_VAL_MIN); 00101 break; 00102 case BRANCH_INVERSE: 00103 branch(*this, le.slice(le.size()-1,-1), INT_VAR_NONE, INT_VAL_MIN); 00104 break; 00105 case BRANCH_SIZE: 00106 branch(*this, le, INT_VAR_SIZE_MIN, INT_VAL_MIN); 00107 break; 00108 } 00109 } 00110 00112 Alpha(bool share, Alpha& s) : Script(share,s) { 00113 le.update(*this, share, s.le); 00114 } 00116 virtual Space* 00117 copy(bool share) { 00118 return new Alpha(share,*this); 00119 } 00121 virtual void 00122 print(std::ostream& os) const { 00123 os << "\t"; 00124 for (int i = 0; i < n; i++) { 00125 os << ((char) (i+'a')) << '=' << le[i] << ((i<n-1)?", ":"\n"); 00126 if ((i+1) % 8 == 0) 00127 os << std::endl << "\t"; 00128 } 00129 os << std::endl; 00130 } 00131 }; 00132 00136 int 00137 main(int argc, char* argv[]) { 00138 Options opt("Alpha"); 00139 opt.solutions(0); 00140 opt.iterations(10); 00141 opt.branching(Alpha::BRANCH_NONE); 00142 opt.branching(Alpha::BRANCH_NONE, "none"); 00143 opt.branching(Alpha::BRANCH_INVERSE, "inverse"); 00144 opt.branching(Alpha::BRANCH_SIZE, "size"); 00145 opt.parse(argc,argv); 00146 Script::run<Alpha,DFS,Options>(opt); 00147 return 0; 00148 } 00149 00150 // STATISTICS: example-any 00151