/* Roger Jang, Oct 1996 */ /* This program is tested on Sun SparcStation */ #include #include #include #define SIZE 8 void print_matrix(int board[][SIZE]) { int i, j; for (i=0; i=0; i--) if (0==board[i][y]) board[i][y]=1; for (j=y+1; j=0; j--) if (0==board[x][j]) board[x][j]=1; for (i=x+1,j=y+1; i=0 && j>=0; i--,j--) if (0==board[i][j]) board[i][j]=1; for (i=x+1,j=y-1; i=0; i++,j--) if (0==board[i][j]) board[i][j]=1; for (i=x-1,j=y+1; i>=0 && j available, 1 -> forbidden, 2 -> occupied.*/ int board[SIZE][SIZE]; int current_pos[2]; int i, j; int done = 0, try_n = 0; int success; srand(time(NULL)); while (done != 1) { /* Initial board */ for (i=0; i