magic-square.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-10-07 11:52:01 +0200 (Thu, 07 Oct 2010) $ by $Author: schulte $ 00011 * $Revision: 11473 $ 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 #include <gecode/int.hh> 00040 #include <gecode/minimodel.hh> 00041 00042 using namespace Gecode; 00043 00054 class MagicSquare : public Script { 00055 private: 00057 const int n; 00059 IntVarArray x; 00060 00061 public: 00063 MagicSquare(const SizeOptions& opt) 00064 : n(opt.size()), x(*this,n*n,1,n*n) { 00065 // Number of fields on square 00066 const int nn = n*n; 00067 00068 // Sum of all a row, column, or diagonal 00069 const int s = nn*(nn+1) / (2*n); 00070 00071 // Matrix-wrapper for the square 00072 Matrix<IntVarArray> m(x, n, n); 00073 00074 for (int i = n; i--; ) { 00075 linear(*this, m.row(i), IRT_EQ, s, opt.icl()); 00076 linear(*this, m.col(i), IRT_EQ, s, opt.icl()); 00077 } 00078 // Both diagonals must have sum s 00079 { 00080 IntVarArgs d1y(n); 00081 IntVarArgs d2y(n); 00082 for (int i = n; i--; ) { 00083 d1y[i] = m(i,i); 00084 d2y[i] = m(n-i-1,i); 00085 } 00086 linear(*this, d1y, IRT_EQ, s, opt.icl()); 00087 linear(*this, d2y, IRT_EQ, s, opt.icl()); 00088 } 00089 00090 // All fields must be distinct 00091 distinct(*this, x, opt.icl()); 00092 00093 // Break some (few) symmetries 00094 rel(*this, m(0,0), IRT_GR, m(0,n-1)); 00095 rel(*this, m(0,0), IRT_GR, m(n-1,0)); 00096 00097 branch(*this, x, INT_VAR_SIZE_MIN, INT_VAL_SPLIT_MIN); 00098 } 00099 00101 MagicSquare(bool share, MagicSquare& s) : Script(share,s), n(s.n) { 00102 x.update(*this, share, s.x); 00103 } 00104 00106 virtual Space* 00107 copy(bool share) { 00108 return new MagicSquare(share,*this); 00109 } 00111 virtual void 00112 print(std::ostream& os) const { 00113 // Matrix-wrapper for the square 00114 Matrix<IntVarArray> m(x, n, n); 00115 for (int i = 0; i<n; i++) { 00116 os << "\t"; 00117 for (int j = 0; j<n; j++) { 00118 os.width(2); 00119 os << m(i,j) << " "; 00120 } 00121 os << std::endl; 00122 } 00123 } 00124 00125 }; 00126 00130 int 00131 main(int argc, char* argv[]) { 00132 SizeOptions opt("MagicSquare"); 00133 opt.iterations(1); 00134 opt.size(7); 00135 opt.parse(argc,argv); 00136 Script::run<MagicSquare,DFS,SizeOptions>(opt); 00137 return 0; 00138 } 00139 00140 // STATISTICS: example-any 00141