45 using namespace Gecode;
51 vector<vector<int> > layout;
53 vector<int> layer, pile;
61 void generate(
int seed) {
63 layout = vector<vector<int> >(17, vector<int>(3));
66 for (
int i = 51;
i--; ) deck[
i] =
i+1;
68 std::random_shuffle(deck.begin(), deck.end(), rnd);
72 for (
int i = 17;
i--; )
73 for (
int j = 3; j--; )
74 layout[
i][j] = deck[pos++];
77 layer = vector<int>(52);
78 pile = vector<int>(52);
79 for (
int i = 17;
i--; ) {
80 for (
int j = 3; j--; ) {
81 layer[layout[
i][j]] = j;
82 pile[ layout[
i][j]] =
i;
112 const char* suit =
"SCHD";
113 std::ostringstream o;
114 o << std::setw(2) << (1 + (val%13)) << suit[val/13];
128 PROPAGATION_TUPLE_SET
132 :
x(*this, 52, 0,51), y(*this, 52, 0,51)
145 for (
int i = 0;
i < 52; ++
i) {
148 for (
int i = 0;
i < 51; ++
i) {
149 IntVar x1(*
this, 0, 12), x2(*
this, 0, 12);
151 element(*
this, modtable,
x[i+1], x2);
152 const int dr[2] = {1, 12};
159 for (
int r = 13;
r--; ) {
160 for (
int s1 = 4; s1--; ) {
161 for (
int s2 = 4; s2--; ) {
162 for (
int i = -1;
i <= 1;
i+=2) {
171 DFA table(expression);
173 for (
int i = 51;
i--; )
179 for (
int r = 13;
r--; )
180 for (
int s1 = 4; s1--; )
181 for (
int s2 = 4; s2--; )
182 for (
int i = -1;
i <= 1;
i+=2) {
187 for (
int i = 51;
i--; )
192 for (
int i = 17;
i--; )
193 for (
int j = 2; j--; )
194 rel(*
this, y[layout[
i][j]] < y[layout[
i][j+1]]);
201 if (opt.
symmetry() == SYMMETRY_CONDITIONAL) {
203 for (
int r = 13;
r--; ) {
205 for (
int s1 = 4; s1--; ) {
206 for (
int s2 = s1; s2--; ) {
210 if (c1 == 0 || c2 == 0)
continue;
212 if (pile[c1] == pile[c2])
continue;
214 int o1 = c1, o2 = c2;
215 if (pile[c1] > pile[c2] && layer[c2] >= layer[c1])
220 for (
int i = 0;
i < layer[o1]; ++
i)
221 ba <<
expr(*
this, (y[layout[pile[o1]][
i]] < y[o2]));
222 for (
int i = 0;
i < layer[o2]; ++
i)
223 ba <<
expr(*
this, (y[layout[pile[o2]][
i]] < y[o1]));
225 for (
int i = layer[o1]+1;
i < 3; ++
i)
226 ba <<
expr(*
this, (y[o2] < y[layout[pile[o1]][
i]]));
227 for (
int i = layer[o2]+1; i < 3; ++
i)
228 ba <<
expr(*
this, (y[o1] < y[layout[pile[o2]][i]]));
235 rel(*
this, !cond || (y[o1] < y[o2]));
249 if (layer[vals.val()] < w) {
251 if ((w = layer[vals.val()]) == 0)
254 assert(v >= 1 && v < 52);
260 os <<
"Layout:" << std::endl;
261 for (
int i = 0;
i < 17;
i++) {
262 for (
int j = 0; j < 3; j++)
263 os <<
card(layout[
i][j]) <<
" ";
269 os << std::endl << std::endl;
271 os <<
"Solution:" << std::endl;
272 for (
int i = 0;
i < 52; ++
i) {
274 os <<
card(
x[
i].val()) <<
" ";
277 if ((
i + 1) % 13 == 0)
286 x.update(*
this, share, s.
x);
287 y.update(*
this, share, s.
y);
304 "no symmetry breaking");
306 "break conditional symmetries");
309 "reified",
"use reified propagation");
311 "dfa",
"use DFA-based extensional propagation");
313 "tuple-set",
"use TupleSet-based extensional propagation");
315 opt.
parse(argc,argv);
317 generate(opt.
size());
318 Script::run<BlackHole,DFS,SizeOptions>(
opt);