mix up the order

[matchsticks-search.git] / main.c

diff --git a/main.c b/main.c
index 9e7b0ede95c7fdd5327776a6a381ff3cbee66a21..cbc78857a6bf17a1b7ed95270aba783e66b1fb80 100644 (file)
--- a/main.c
+++ b/main.c
@@ -13,6 +13,8 @@ typedef uint32_t AdjWord;
 #define PRADJ "08"PRIx32
 
 static int n, m;
+static AdjWord *adjmatrix_counters;
+static AdjWord *adjmatrix_offsets;
 static AdjWord *adjmatrix;
 static AdjWord adjall;
 
@@ -27,9 +29,14 @@ static AdjWord *xalloc_adjmatrix(void) {
 }
 
 static void prep(void) {
+  int i;
   adjall = ~((~(AdjWord)0) << m);
   adjmatrix = xalloc_adjmatrix();
+  adjmatrix_counters = xalloc_adjmatrix();
+  adjmatrix_offsets = xalloc_adjmatrix();
   glp_term_out(GLP_OFF);
+  for (i=0; i<n; i++)
+    adjmatrix_offsets[i] = ((i+1)*(AdjWord)0x12345678) & adjall;
 }
 
 static AdjWord one_adj_bit(int bitnum) {
@@ -161,14 +168,14 @@ static void optimise(int doprint) {
                  matrix_entries);
 
   int r = glp_simplex(prob, NULL);
-  PRINTF(" simplex=%d", r);
+  PRINTF(" glp=%d", r);
 
 #define OKERR(e) \
   case e: PRINTF(" " #e ); goto out;
 #define BADERR(e) \
-  case e: HAVE_PRINTED; printf(" " #e " CRASHING"); exit(-1);
+  case e: HAVE_PRINTED; printf(" " #e " CRASHING\n"); exit(-1);
 #define DEFAULT \
-  default: HAVE_PRINTED; printf(" ! CRASHING"); exit(-1);
+  default: HAVE_PRINTED; printf(" ! CRASHING\n"); exit(-1);
 
   switch (r) {
   OKERR(GLP_ESING);
@@ -182,6 +189,8 @@ static void optimise(int doprint) {
   BADERR(GLP_EOBJUL);
   BADERR(GLP_EITLIM);
   BADERR(GLP_ETMLIM);
+  BADERR(GLP_EINSTAB);
+  BADERR(GLP_ENOCVG);
   case 0: break;
   DEFAULT;
   }
@@ -227,21 +236,26 @@ static void optimise(int doprint) {
 
 static void iterate_recurse(int i, AdjWord min) {
   if (i >= n) {
+    int ii;
+    for (ii=0; ii<n; ii++) {
+      adjmatrix[ii] = adjmatrix_counters[ii] ^ adjmatrix_offsets[ii];
+      if (!adjmatrix[ii]) return;
+    }
     printcounter++;
     optimise(!(printcounter & 0xfff));
     return;
   }
-  for (adjmatrix[i] = min;
+  for (adjmatrix_counters[i] = min;
        ;
-       adjmatrix[i]++) {
-    iterate_recurse(i+1, adjmatrix[i]);
-    if (adjmatrix[i] == adjall)
+       adjmatrix_counters[i]++) {
+    iterate_recurse(i+1, adjmatrix_counters[i]);
+    if (adjmatrix_counters[i] == adjall)
       return;
   }
 }
 
 static void iterate(void) {
-  iterate_recurse(0, 1);
+  iterate_recurse(0, 0);
 }
 
 int main(int argc, char **argv) {