1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 | \* Quasigroup generator for ILOG Solver Code due to Kostas Stergiou All the usual disclaimers apply *\ #include <ilsolver/ilcint.h> #include <stdlib.h> class quasi { public : quasi(IlcManager, IlcInt, IlcInt); void set_constraints(); void print_solution(IlcInt); private : void row_constraints(IlcInt, IlcInt, IlcInt); void column_constraints(IlcInt, IlcInt, IlcInt); void QG1(); void QG2(); void QG3(); void QG4(); void QG5(); void QG6(); void QG7(); IlcManager manager; IlcInt n; IlcInt axiom; IlcIntVarArray square; }; quasi::quasi(IlcManager m, IlcInt order, IlcInt property) : manager(m), n(order), axiom(property), square(m,n*n,0,n-1) { } void quasi::print_solution(IlcInt max) { IncInt i,j; for (i=0; i<max*max; i++) manager.out() << square[i] << " " ; } void quasi::row_constraints(IlcInt min, IlcInt max, IlcInt rowno) { IlcInt j; IlcIntVarArray array(manager,max); for (j=min; j<max; j++) array[j]=square[rowno*max+j]; manager.add(IlcAllDiff(array, IlcWhenDomain)); } void quasi::column_constraints(IlcInt min, IlcInt max, IlcInt columnno) { IlcInt j; IlcIntVarArray array(manager,max); for (j=min; j<max; j++) array[j]=square[j*max+columnno]; manager.add(IlcAllDiff(array, IlcWhenDomain)); } void quasi::set_constraints() { IlcInt i; for (i=0; i<n; i++) row_constraints(0, n, i); // AllDiff for rows for (i=0; i<n; i++) column_constraints(0, n, i); // AllDiff for columns for (i=0; i<n; i++) manager.add(square[i*n+i]==i); // Idempotency for (i=0; i<n; i++) manager.add(square[i*n+n-1]>=i-1); // Symmetry Break switch (axiom) { case 3 : QG3(); break ; case 4 : QG4(); break ; case 5 : QG5(); break ; case 6 : QG6(); break ; case 7 : QG7(); break ; default : printf ( "no such condition\n" ); exit (1); } IlcGoal goal; goal = IlcGenerate(square, IlcChooseMinSizeInt); manager.add(goal); } void quasi::QG3() { IlcInt i,j; for (i=0; i<n; i++) { for (j=0; j<n; j++) { manager.add(square[square[i*n+j]*n+square[j*n+i]]==i); } } } void quasi::QG4() { IlcInt i,j; for (i=0; i<n; i++) { for (j=0; j<n; j++) { manager.add(square[square[j*n+i]*n+square[i*n+j]]==i); } } } void quasi::QG5() { IlcInt i,j; for (i=0; i<n; i++) { for (j=0; j<n; j++) { manager.add(square[square[square[j*n+i]*n+j]*n+j]==i); } } } void quasi::QG6() { IlcInt i,j; for (i=0; i<n; i++) { for (j=0; j<n; j++) { manager.add(square[square[i*n+j]*n+j]==square[i*n+square[i*n+j]]); } } } void quasi::QG7() { IlcInt i,j; for (i=0; i<n; i++) { for (j=0; j<n; j++) { manager.add(square[square[j*n+i]*n+j]==square[i*n+square[j*n+i]]); } } } IlcInt main( int argc, char **argv) { IlcInt order, axiom, NumberOfModels=0; if (argc!=3) { printf ( "USAGE\n" ); printf ( "Order Axiom\n" ); exit (1); } order = atoi (argv[1]); axiom = atoi (argv[2]); IlcManager m(IlcNoEdit); quasi qg(m,order,axiom); qg.set_constraints(); if (m.nextSolution()) { qg.print_solution(order); } return 0; } |