1 #include <stdio.h> 2 3 #include "xvier.h" 4 #include "vier.h" 5 vierinit()6void vierinit() 7 { 8 int i, j, pui; 9 10 vnum = rows * (columns - 3) + columns * (rows - 3) + 11 2 * (columns - 3) * (rows - 3); 12 row_col = rows * columns; 13 row_1_col = row_col - columns; 14 row_2_col = row_1_col - columns; 15 brett = (int *)malloc(row_col * sizeof(int)); 16 for (i = 0; i < (row_col); i++) 17 brett[i] = 0; 18 weiss = (int *)malloc(vnum * sizeof(int)); 19 schwarz = (int *)malloc(vnum * sizeof(int)); 20 for (i = 0; i < vnum; i++) 21 weiss[i] = schwarz[i] = 1; 22 for (i = 0; i < columns; i++) { 23 frei[i] = i; 24 doubles[i] = 0; 25 } 26 freip = (int **)malloc(row_col * sizeof(int *)); 27 for (j = 0; j < rows; j++) 28 for (i = 0; i < columns; i++) 29 freip[j * columns + i] = frei + i; 30 doublesp = (int **)malloc(row_col * sizeof(int *)); 31 for (j = 0; j < rows; j++) 32 for (i = 0; i < columns; i++) 33 doublesp[j * columns + i] = doubles + i; 34 j = 0; 35 i = ((columns - 1) >> 1); 36 if (columns & 1) 37 reihenfolge[j++] = i; 38 else { 39 reihenfolge[j++] = i; 40 reihenfolge[j++] = i + 1; 41 } 42 for (i--; i >= 0; i--) { 43 reihenfolge[j++] = i; 44 reihenfolge[j++] = columns - 1 - i; 45 } 46 pu = (int (*)[4])malloc(vnum * sizeof(*pu)); 47 pui = 0; 48 for (i = (rows - 1) * columns; i >= 0; i -= columns) 49 for (j = 0; j <= columns - 4; j++) { 50 pu[pui][0] = i + j; 51 pu[pui][1] = i + j + 1; 52 pu[pui][2] = i + j + 2; 53 pu[pui][3] = i + j + 3; 54 pui++; 55 } 56 for (i = (rows - 4) * columns; i >= 0; i -= columns) 57 for (j = 0; j < columns; j++) { 58 pu[pui][0] = i + j; 59 pu[pui][1] = i + j + columns; 60 pu[pui][2] = i + j + 2 * columns; 61 pu[pui][3] = i + j + 3 * columns; 62 pui++; 63 } 64 for (i = (rows - 4) * columns; i >= 0; i -= columns) 65 for (j = 3; j < columns; j++) { 66 pu[pui][0] = i + j; 67 pu[pui][1] = i + j + columns - 1; 68 pu[pui][2] = i + j + 2 * (columns - 1); 69 pu[pui][3] = i + j + 3 * (columns - 1); 70 pui++; 71 } 72 for (i = (rows - 4) * columns; i >= 0; i -= columns) 73 for (j = 0; j <= columns - 4; j++) { 74 pu[pui][0] = i + j; 75 pu[pui][1] = i + j + columns + 1; 76 pu[pui][2] = i + j + 2 * (columns + 1); 77 pu[pui][3] = i + j + 3 * (columns + 1); 78 pui++; 79 } 80 _p_h_ = (int *)malloc((row_col + 4 * vnum) * sizeof(int)); 81 pp = (int **)malloc(row_col * sizeof(int *)); 82 for (pui = i = 0; i < row_col; i++) { 83 pp[i] = _p_h_ + pui; 84 for (j = 0; j < vnum; j++) 85 if (pu[j][0] == i || pu[j][1] == i || pu[j][2] == i || pu[j][3] == i) 86 _p_h_[pui++] = j; 87 _p_h_[pui++] = -1; 88 } 89 sp = stack = (struct oldv *) 90 malloc(4 * (vnum + row_col) * sizeof(struct oldv)); 91 zugstack = (struct oldv **)malloc(row_col * sizeof(struct oldv *)); 92 } 93