Jip J. Dekker
981be2067e
git-subtree-dir: software/gecode_on_replay git-subtree-split: 8051d92b9c89e49cccfbd1c201371580d7703ab4
146 lines
4.2 KiB
C++
146 lines
4.2 KiB
C++
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
|
|
*
|
|
* Copyright:
|
|
* Vincent Barichard, 2013
|
|
*
|
|
* Last modified:
|
|
* $Date$ by $Author$
|
|
* $Revision$
|
|
*
|
|
* This file is part of Quacode:
|
|
* http://quacode.barichard.com
|
|
*
|
|
* 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 <iostream>
|
|
#include <vector>
|
|
|
|
#include <quacode/qspaceinfo.hh>
|
|
#include <gecode/minimodel.hh>
|
|
#include <gecode/driver.hh>
|
|
|
|
|
|
using namespace Gecode;
|
|
|
|
#ifdef GECODE_HAS_GIST
|
|
namespace Gecode { namespace Driver {
|
|
/// Specialization for QDFS
|
|
template<typename S>
|
|
class GistEngine<QDFS<S> > {
|
|
public:
|
|
static void explore(S* root, const Gist::Options& opt) {
|
|
(void) Gist::explore(root, false, opt);
|
|
}
|
|
};
|
|
}}
|
|
#endif
|
|
|
|
|
|
/**
|
|
* \brief Options taking one additional parameter
|
|
*/
|
|
class BakerOptions : public Options {
|
|
public:
|
|
/// Print strategy or not
|
|
Gecode::Driver::BoolOption _printStrategy;
|
|
int n; /// Parameter to be given on the command line
|
|
/// Initialize options for example with name \a s
|
|
BakerOptions(const char* s, int n0)
|
|
: Options(s),
|
|
_printStrategy("-printStrategy","Print strategy",false),
|
|
n(n0) {
|
|
add(_printStrategy);
|
|
}
|
|
/// Parse options from arguments \a argv (number is \a argc)
|
|
void parse(int& argc, char* argv[]) {
|
|
Options::parse(argc,argv);
|
|
if (argc < 2)
|
|
return;
|
|
n = atoi(argv[1]);
|
|
}
|
|
/// Return true if the strategy must be printed
|
|
bool printStrategy(void) const {
|
|
return _printStrategy.value();
|
|
}
|
|
/// Print help message
|
|
virtual void help(void) {
|
|
Options::help();
|
|
std::cerr << "\t(unsigned int) default: " << n << std::endl
|
|
<< "\t\tValue used to restrict the domain of w1 in order to make the problem harder" << std::endl;
|
|
}
|
|
};
|
|
|
|
class QCSPBaker : public Script, public QSpaceInfo {
|
|
IntVarArray X;
|
|
|
|
public:
|
|
QCSPBaker(const BakerOptions& opt) : Script(opt), QSpaceInfo()
|
|
{
|
|
std::cout << "Loading problem" << std::endl;
|
|
if (!opt.printStrategy()) strategyMethod(0); // disable build and print strategy
|
|
using namespace Int;
|
|
|
|
IntVarArgs w(*this,5,1,opt.n);
|
|
IntVar f(*this,1,opt.n);
|
|
setForAll(*this, f);
|
|
IntVarArgs c(*this,5,-1,1);
|
|
IntVarArgs vaX;
|
|
vaX << w << f << c;
|
|
X = IntVarArray(*this, vaX);
|
|
|
|
IntVar o1(*this,-opt.n,opt.n), o2(*this,-opt.n,opt.n), o3(*this,-opt.n,opt.n), o4(*this,-opt.n,opt.n), o5(*this,-opt.n,opt.n);
|
|
rel(*this, w[0] * c[0] == o1);
|
|
rel(*this, w[1] * c[1] == o2);
|
|
rel(*this, w[2] * c[2] == o3);
|
|
rel(*this, w[3] * c[3] == o4);
|
|
rel(*this, w[4] * c[4] == o5);
|
|
rel(*this, o1 + o2 + o3 + o4 + o5 == f);
|
|
|
|
branch(*this, X, INT_VAR_NONE(), INT_VALUES_MIN());
|
|
}
|
|
|
|
QCSPBaker(bool share, QCSPBaker& p) : Script(share,p), QSpaceInfo(*this,share,p)
|
|
{
|
|
X.update(*this,share,p.X);
|
|
}
|
|
|
|
virtual Space* copy(bool share) { return new QCSPBaker(share,*this); }
|
|
|
|
|
|
void print(std::ostream& os) const {
|
|
strategyPrint(os);
|
|
}
|
|
};
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
|
|
BakerOptions opt("Baker Problem",40);
|
|
opt.parse(argc,argv);
|
|
Script::run<QCSPBaker,QDFS,BakerOptions>(opt);
|
|
|
|
return 0;
|
|
}
|