java基于swing实现的五子棋游戏代码(19)

                        ((state[i][j]==0)&&(state[i][j+1]==2)&&(state[i][j+2]==2)&&(state[i][j+3]==1))||
                                ((state[i][j]==0)&&(state[i][j-1]==2)&&(state[i][j-2]==2)&&(state[i][j-3]==1))||
                                ((state[i][j]==0)&&(state[i+1][j]==2)&&(state[i+2][j]==2)&&(state[i+3][j]==1))||
                                ((state[i][j]==0)&&(state[i-1][j]==2)&&(state[i-2][j]==2)&&(state[i-3][j]==1))||
                                ((state[i][j]==0)&&(state[i+1][j+1]==2)&&(state[i+2][j+2]==2)&&(state[i+3][j+3]==1))||
                                ((state[i][j]==0)&&(state[i+1][j-1]==2)&&(state[i+2][j-2]==2)&&(state[i+3][j-3]==1))||
                                ((state[i][j]==0)&&(state[i-1][j+1]==2)&&(state[i-2][j+2]==2)&&(state[i-3][j+3]==1))||
                                ((state[i][j]==0)&&(state[i-1][j-1]==2)&&(state[i-2][j-2]==2)&&(state[i-3][j-3]==1))){
                                value[i][j]=1;
                                return value[i][j];
                }
                else{
                        value[i][j]=0;
                        return value[i][j];
                }

    }
    public int[] largestValue(int[][] value){
            int max,i,j,l,k;
            l=0;k=0;
            max=0;
            for(i=5;i<34;i++){
                    for(j=5;j<34;j++){
                            if(max<value[i][j]){
                                    max=value[i][j];
                                    place[0]=i;
                                    place[1]=j;
                            }
                    }
            }
            return place;
    }

}