main page modules namespaces classes files
Gecode home

search for 

magic-sequence.cc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2001
 *
 *  Last modified:
 *     $Date: 2006-08-04 16:06:52 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
 *     $Revision: 3517 $
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.org
 *
 *  See the file "LICENSE" for information on usage and
 *  redistribution of this file, and for a
 *     DISCLAIMER OF ALL WARRANTIES.
 *
 */

#include "examples/support.hh"
#include "gecode/minimodel.hh"

class MagicSequence : public Example {
private:
  const int n;
  IntVarArray s;
public:
  void
  exactly(IntVarArray& v, IntVar& x, int i) {
    // I occurs in V X times
    BoolVarArgs b(v.size());
    for (int j = v.size(); j--; )
      b[j] = post(this, ~(v[j] == i));
    linear(this, b, IRT_EQ, x);
  }
  MagicSequence(const Options& opt)
    : n(opt.size), s(this,n,0,n-1) {
    if (opt.naive)
      for (int i=n; i--; )
        exactly(s, s[i], i);
    else
      for (int i=n; i--; )
        count(this, s, i, IRT_EQ, s[i]);
    linear(this, s, IRT_EQ, n);
    IntArgs c(n);
    for (int j = n; j--; )
      c[j] = j-1;
    linear(this, c, s, IRT_EQ, 0);
    branch(this, s, BVAR_NONE, BVAL_SPLIT_MAX);
  }

  MagicSequence(bool share, MagicSequence& e) : Example(share,e), n(e.n) {
    s.update(this, share, e.s);
  }
  virtual Space*
  copy(bool share) {
    return new MagicSequence(share,*this);
  }
  virtual
  void print(void) {
    std::cout << "\t";
    for (int i = 0; i<n; i++) {
      std::cout << s[i] << ", ";
      if ((i+1) % 20 == 0)
        std::cout << std::endl << "\t";
    }
    std::cout << std::endl;
  }

};

int
main(int argc, char** argv) {
  Options opt("MagicSequence");
  opt.solutions  = 0;
  opt.iterations = 4;
  opt.size       = 500;
  opt.parse(argc,argv);
  Example::run<MagicSequence,DFS>(opt);
  return 0;
}

// STATISTICS: example-any