/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Copyright: * Christian Schulte, 2004 * * Last modified: * $Date: 2007-11-30 13:58:34 +0100 (Fri, 30 Nov 2007) $ by $Author: tack $ * $Revision: 5524 $ * * 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 "examples/support.hh" /** * \brief %Example: Orthogonal latin squares * * \ingroup ExProblem */ class OrthoLatinSquare : public Example { protected: /// Size of squares const int n; /// Fields of first square IntVarArray x1; /// Fields of second square IntVarArray x2; public: /// Access field at position \a i and \a j in first square IntVar& y1(int i, int j) { return x1[i*n+j]; } /// Access field at position \a i and \a j in second square IntVar& y2(int i, int j) { return x2[i*n+j]; } /// Actual model OrthoLatinSquare(const SizeOptions& opt) : n(opt.size()), x1(this,n*n,1,n), x2(this,n*n,1,n) { const int nn = n*n; IntVarArray z(this,nn,0,n*n-1); distinct(this, z, opt.icl()); // Connect { IntArgs mod(n*n); IntArgs div(n*n); for (int i=0; i(opt); return 0; } // STATISTICS: example-any