Differences

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

--- the_eight_queens_solver [2012/02/21 07:24] – xjia
+++ the_eight_queens_solver [2012/02/23 14:02] (current) – xjia
@@ Line 1: / Line 1: @@
-<code>
+<code java>
 /* The eight queens solver */
-int main(string[] args) {
+int main(string[ ] args) {
   int N;
-  int[] row, col, diag1, diag2;
+  int[] row, col;
+  int[][] d;
   N = 8;
   row = new int[N];
   col = new int[N];
-  diag1 = new int[N+N-1];
+  d = new int[][2];
-  diag2 = new int[N+N-1];
+  d[0] = new int[N+N-1];
+  d[1] = new int[N+N-1];
-  fill(row, 0);
+  // fillIntArray is a contributed function
-  fill(col, 0);
+  fillIntArray(row, 0);
-  fill(diag1, 0);
+  fillIntArray(col, 0);
-  fill(diag2, 0);
+  fillIntArray(d[0], 0);
+  fillIntArray(d[1], 0);
-  try(N, row, col, diag1, diag2, 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 42: / Line 36: @@
       }
     }
-    printLine("");
+    printChar('\n');
   }
-  printLine("");
+  printChar('\n');
-  return 0;
 }
-int try(int N, int[] row, int[] col, int[] diag1, int[] diag2, int c) {
+int search(int N, int[] row, int[] col, int[][] d, int c) {
   int r;
@@ Line 55: / Line 48: @@
   } else {
     for (r = 0; r < N; r = r+1) {
-      if (row[r] == 0 && diag1[r+c] == 0 && diag2[r+N-1-c] == 0) {
+      if (row[r] == 0 && d[0][r+c] == 0 && d[1][r+N-1-c] == 0) {
-        row[r] = 1;
+        row[r] = d[0][r+c] = d[1][r+N-1-c] = 1;
-        diag1[r+c] = 1;
-        diag2[r+N-1-c] = 1;
         col[c] = r;
-        try(N, row, col, diag1, diag2, c+1);
+        search(N, row, col, d, c+1);
-        row[r] = 0;
+        row[r] = d[0][r+c] = d[1][r+N-1-c] = 0;
-        diag1[r+c] = 0;
-        diag2[r+N-1-c] = 0;
       }
     }
   }
-  return 0;
 }
 </code>
+Note that ''fillIntArray'' is a [[contributed_functions|contributed function]].