1.判断胜负时的优化算法
新改优化算法在原有基础代码的基础上，优点在于可以进一步升级更替为五子棋等等
char IsWin(char board[ROW][COL], int row, int col)
{
int i = 0;
int j = 0;
int t = 0;
int d = 0;
char set = '0';
for(i=0; i<row; i++)
{
for(t=0; t<row-2; t++)
{
if(board[i][t] == board[i][t+1] && board[i][t+1] == board[i][t+2] && board[i][t] != ' ')
return set=board[i][0];
}
/*if(board[i][0] == board[i][1] && board[i][1] == board[i][2] && board[i][1] != ' ')
return board[i][0];*/
}
for(j=0; j<col; j++)
{
for(t=0; t<col-2; t++)
{
if(board[t][j] == board[t+1][j] && board[t+1][j] == board[t+2][j] && board[t+1][j] != ' ')
return set=board[t+1][j];
}
/*if(board[0][j] == board[1][j] && board[1][j] == board[2][j] && board[1][j] != ' ')
return board[1][j];*/
}
for(t=0; t<row-2; t++)
{
if(board[t+d][t+d] == board[d+t+1][d+t+1] && board[t+d+1][t+d+1] == board[t+d+2][t+d+2] && board[t+d+1][t+d+1] != ' ')
return set=board[t+d+1][t+d+1];
}
/*if(board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[1][1] != ' ')
return board[1][1];*/
d = 0;
for(t=0; t<row-2; t++)
{
if(board[t][row-1-t] == board[t+1][row-2-t] && board[t+1][row-2-t] == board[t+2][row-3-t] && board[t+1][row-2-t] != ' ')
return set=board[t+1][row-2-t];
}
/*else if(board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[1][1] != ' ')
return board[1][1];*/
if(set != '#' && set != '+')
{
if(IsFull(board,ROW,COL))
return 'q';
}
return ' ';
}