Differences

This shows you the differences between two versions of the page.

--- the_eight_queens_solver [2012/02/21 07:33] – xjia
+++ the_eight_queens_solver [2012/02/23 14:02] (current) – xjia
@@ Line 2: / Line 2: @@
 /* The eight queens solver */
-int main(string[] args) {
+int main(string[ ] args) {
   int N;
   int[] row, col;
@@ Line 14: / Line 14: @@
   d[1] = new int[N+N-1];
-  fill(row, 0);
+  // fillIntArray is a contributed function
-  fill(col, 0);
+  fillIntArray(row, 0);
-  fill(d[0], 0);
+  fillIntArray(col, 0);
-  fill(d[1], 0);
+  fillIntArray(d[0], 0);
+  fillIntArray(d[1], 0);
-  try(N, row, col, d, 0);
+  search(N, row, col, d, 0);
-  return 0;
-}
-int fill(int[] a, int v) {
-  int i;
-  for (i = 0; i < a.length; i = i+1) {
-    a[i] = v;
-  }
   return 0;
 }
@@ Line 44: / Line 36: @@
       }
     }
-    printLine("");
+    printChar('\n');
   }
-  printLine("");
+  printChar('\n');
-  return 0;
 }
-int try(int N, int[] row, int[] col, int[][] d, int c) {
+int search(int N, int[] row, int[] col, int[][] d, int c) {
   int r;
@@ Line 60: / Line 51: @@
         row[r] = d[0][r+c] = d[1][r+N-1-c] = 1;
         col[c] = r;
-        try(N, row, col, d, c+1);
+        search(N, row, col, d, c+1);
         row[r] = d[0][r+c] = d[1][r+N-1-c] = 0;
       }
     }
   }
-  return 0;
 }
 </code>
+Note that ''fillIntArray'' is a [[contributed_functions|contributed function]].