Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
4.8 kB · 148 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2001 * * 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 <gecode/driver.hh>
#include <gecode/int.hh>#include <gecode/minimodel.hh>
using namespace Gecode;
/** * \brief %Example: %Alpha puzzle * * Well-known cryptoarithmetic puzzle of unknown origin. * * \ingroup Example * */class Alpha : public Script {protected: /// Alphabet has 26 letters static const int n = 26; /// Array for letters IntVarArray le;public: /// Branching to use for model enum { BRANCH_NONE, ///< Choose variable left to right BRANCH_INVERSE, ///< Choose variable right to left BRANCH_SIZE ///< Choose variable with smallest size }; /// Actual model Alpha(const Options& opt) : Script(opt), le(*this,n,1,n) { IntVar a(le[ 0]), b(le[ 1]), c(le[ 2]), e(le[ 4]), f(le[ 5]), g(le[ 6]), h(le[ 7]), i(le[ 8]), j(le[ 9]), k(le[10]), l(le[11]), m(le[12]), n(le[13]), o(le[14]), p(le[15]), q(le[16]), r(le[17]), s(le[18]), t(le[19]), u(le[20]), v(le[21]), w(le[22]), x(le[23]), y(le[24]), z(le[25]);
rel(*this, b+a+l+l+e+t == 45, opt.ipl()); rel(*this, c+e+l+l+o == 43, opt.ipl()); rel(*this, c+o+n+c+e+r+t == 74, opt.ipl()); rel(*this, f+l+u+t+e == 30, opt.ipl()); rel(*this, f+u+g+u+e == 50, opt.ipl()); rel(*this, g+l+e+e == 66, opt.ipl()); rel(*this, j+a+z+z == 58, opt.ipl()); rel(*this, l+y+r+e == 47, opt.ipl()); rel(*this, o+b+o+e == 53, opt.ipl()); rel(*this, o+p+e+r+a == 65, opt.ipl()); rel(*this, p+o+l+k+a == 59, opt.ipl()); rel(*this, q+u+a+r+t+e+t == 50, opt.ipl()); rel(*this, s+a+x+o+p+h+o+n+e == 134, opt.ipl()); rel(*this, s+c+a+l+e == 51, opt.ipl()); rel(*this, s+o+l+o == 37, opt.ipl()); rel(*this, s+o+n+g == 61, opt.ipl()); rel(*this, s+o+p+r+a+n+o == 82, opt.ipl()); rel(*this, t+h+e+m+e == 72, opt.ipl()); rel(*this, v+i+o+l+i+n == 100, opt.ipl()); rel(*this, w+a+l+t+z == 34, opt.ipl());
distinct(*this, le, opt.ipl());
switch (opt.branching()) { case BRANCH_NONE: branch(*this, le, INT_VAR_NONE(), INT_VAL_MIN()); break; case BRANCH_INVERSE: branch(*this, le.slice(le.size()-1,-1), INT_VAR_NONE(), INT_VAL_MIN()); break; case BRANCH_SIZE: branch(*this, le, INT_VAR_SIZE_MIN(), INT_VAL_MIN()); break; } }
/// Constructor for cloning \a s Alpha(Alpha& s) : Script(s) { le.update(*this, s.le); } /// Copy during cloning virtual Space* copy(void) { return new Alpha(*this); } /// Print solution virtual void print(std::ostream& os) const { os << "\t"; for (int i = 0; i < n; i++) { os << ((char) (i+'a')) << '=' << le[i] << ((i<n-1)?", ":"\n"); if ((i+1) % 8 == 0) os << std::endl << "\t"; } os << std::endl; }};
/** \brief Main-function * \relates Alpha */intmain(int argc, char* argv[]) { Options opt("Alpha"); opt.solutions(0); opt.iterations(10); opt.branching(Alpha::BRANCH_NONE); opt.branching(Alpha::BRANCH_NONE, "none"); opt.branching(Alpha::BRANCH_INVERSE, "inverse"); opt.branching(Alpha::BRANCH_SIZE, "size"); opt.parse(argc,argv); Script::run<Alpha,DFS,Options>(opt); return 0;}
// STATISTICS: example-any