在linux下ubuntu的五子棋游戏c语言代码(3)

{

int i,j;

for(i = 0;i

if(check(i,j,board)) return 1; } return 0; }

void mouse_doing() {

int fd,step = 1;

int row,col,flag1=1; int max1,max2; char buf[8];

struct node_t p; int mx,my,a,b,c,d,e; mx = FB_W/2-100; my = FB_H/2; int n;

//drawmouse(mx,my);

fd = open(\if(fd < 0) {

printf(\ mouse error!\\n\}

save_cursor(mx,my); drawmouse(mx,my); while(flag1) {

if(read(fd,buf,8) >0) {

e = (buf[0]&0x07); c = 2*buf[1]; d = 2*buf[2]; if(e == NOKEY) {

restore_cursor(mx,my); mx += c; my -= d;

if(mx >= FB_W-17) mx=FB_W-17; if(mx < 0)

mx = 0;

if(my > FB_H-17) my = FB_H-17; if(my < 0) my = 0;

save_cursor(mx,my); drawmouse(mx,my); }

else if(e == 1) {

if(step%2==1) {

// printf(\

col =(int) (mx-X_OFFSET+SPACE/2)/SPACE; row = (int)(my-Y_OFFSET+SPACE/2)/SPACE; if(!(if_done(row,col))||board[row][col]) { //printf(\ !\\n\ col =(int) (mx-X_OFFSET)/SPACE;

row = (int)(my-Y_OFFSET)/SPACE; continue; }

board[row][col] = 1; restore_cursor(mx,my);

printqizi(row,col,BLACK);//鐢婚粦鑹茬殑妫嬪瓙 save_cursor(mx, my); array[row][col][1] = step; step ++;

computer();//鏇存柊浼樺厛绾ц〃 // printf(\ //flag2 = 1;

} else {

// printf(\

max1 = get_max(play1); max2 = get_max(com); if(max1 >= max2) {

p = get_max2(play1); } else{

p = get_max2(com); }

row = p.x; col = p.y; if(!(if_done(row,col))||board[row][col]) { // printf(\ max1 = get_max(play1); max2 = get_max(com); if(max1 >= max2) { p = get_max3(play1); } else{ p = get_max3(com); } row = p.x; col = p.y; continue; }

board[row][col] = 2; computer(board); restore_cursor(mx,my);

printqizi(row,col,WHITE); save_cursor(mx, my); array[row][col][1] = step; step++; //flag2 = 0;

}

if(if_gameover(board)) flag1=0; } else if(e == 2) {

if(step != 1) { p = get_max4(array);

!\\n\ row = p.x; col = p.y; board[row][col] = 0; array[row][col][1] = 0; computer(board); drawbg(row,col); //restore_cursor(mx,my); step--; } } } }

if(board[row][col] ==1)

printf(\ play1 win!\\n\ else

printf(\ }

void mouse_doing2() {

int fd,step = 1;

int row,col,flag1=1; int max1,max2; char buf[8];

struct node_t p; int mx,my,a,b,c,d,e; mx = FB_W/2-100; my = FB_H/2; int n;

//drawmouse(mx,my);

fd = open(\if(fd < 0) {

printf(\ mouse error!\\n\}

save_cursor(mx,my); drawmouse(mx,my); while(flag1) {

if(read(fd,buf,8) >0) {

e = (buf[0]&0x07);

c = 2*buf[1]; d = 2*buf[2]; if(e == NOKEY) {

restore_cursor(mx,my); mx += c; my -= d;

if(mx >= FB_W-17) mx=FB_W-17; if(mx < 0) mx = 0;

if(my > FB_H-17) my = FB_H-17; if(my < 0) my = 0;

save_cursor(mx,my); drawmouse(mx,my); }

else if(e == 1) {

if(step%2==1) {

// printf(\

col =(int) (mx-X_OFFSET+SPACE/2)/SPACE; row = (int)(my-Y_OFFSET+SPACE/2)/SPACE; if(!(if_done(row,col))||board[row][col]) { //printf(\ !\\n\ col =(int) (mx-X_OFFSET)/SPACE;

row = (int)(my-Y_OFFSET)/SPACE; continue; }

board[row][col] = 1; restore_cursor(mx,my);

printqizi(row,col,BLACK);//鐢婚粦鑹茬殑妫嬪瓙 save_cursor(mx, my); array[row][col][1] = step; step ++;

//computer();//鏇存柊浼樺厛绾ц〃 // printf(\