龙盟编程博客 | 无障碍搜索 | 云盘搜索神器
快速搜索
主页 > 软件开发 > JAVA开发 >

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

时间:2014-11-14 11:06来源:网络整理 作者:网络 点击:
分享到:
((state[i][j-3]==1)(state[i][j-2]==2)(state[i][j-1]==2)(state[i][j]==0)(state[i][j+1]==2)(state[i][j+2]==2))|| ((state[i-3][j]==1)(state[i-2][j]==2)(state[i-1][j]==2)(state[i][j]==0)(state[i+1][j]==2)

                                ((state[i][j-3]==1)&&(state[i][j-2]==2)&&(state[i][j-1]==2)&&(state[i][j]==0)&&(state[i][j+1]==2)&&(state[i][j+2]==2))||
                                ((state[i-3][j]==1)&&(state[i-2][j]==2)&&(state[i-1][j]==2)&&(state[i][j]==0)&&(state[i+1][j]==2)&&(state[i+2][j]==2))||
                                ((state[i+3][j-3]==1)&&(state[i+2][j-2]==2)&&(state[i+1][j-1]==2)&&(state[i][j]==0)&&(state[i-1][j+1]==2)&&(state[i-2][j+2]==2))||
                                ((state[i-3][j+3]==1)&&(state[i-2][j+2]==2)&&(state[i-1][j+1]==2)&&(state[i][j]==0)&&(state[i+1][j-1]==2)&&(state[i+2][j-2]==2))||
                                ((state[i][j-2]==2)&&(state[i][j-1]==2)&&(state[i][j]==0)&&(state[i][j+1]==2)&&(state[i][j+2]==2)&&(state[i][j+3]==1))||
                                ((state[i-2][j]==2)&&(state[i-1][j]==2)&&(state[i][j]==0)&&(state[i+1][j]==2)&&(state[i+2][j]==2)&&(state[i+3][j]==1))||
                                ((state[i-3][j-3]==1)&&(state[i-2][j-2]==2)&&(state[i-1][j-1]==2)&&(state[i][j]==0)&&(state[i+1][j+1]==2)&&(state[i+2][j+2]==2))||
                                ((state[i+3][j+3]==1)&&(state[i+2][j+2]==2)&&(state[i+1][j+1]==2)&&(state[i][j]==0)&&(state[i-1][j-1]==2)&&(state[i-2][j-2]==2))||

                                ((state[i][j-1]==1)&&(state[i][j]==0)&&(state[i][j+1]==2)&&(state[i][j+2]==2)&&(state[i][j+3]==2)&&(state[i][j+4]==2))||
                                   ((state[i-1][j]==1)&&(state[i][j]==0)&&(state[i+1][j]==2)&&(state[i+2][j]==2)&&(state[i+3][j]==2)&&(state[i+4][j]==2))||
                                   ((state[i-1][j-1]==1)&&(state[i][j]==0)&&(state[i+1][j+1]==2)&&(state[i+2][j+2]==2)&&(state[i+3][j+3]==2)&&(state[i+4][j+4]==2))||
                                   ((state[i+1][j+1]==1)&&(state[i][j]==0)&&(state[i-1][j-1]==2)&&(state[i-2][j-2]==2)&&(state[i-3][j-3]==2)&&(state[i-4][j-4]==2))||
                                   ((state[i][j+1]==1)&&(state[i][j]==0)&&(state[i][j+1]==2)&&(state[i][j+2]==2)&&(state[i][j+3]==2)&&(state[i][j+4]==2))||
                                   ((state[i+1][j]==1)&&(state[i][j]==0)&&(state[i-1][j]==2)&&(state[i-2][j]==2)&&(state[i-3][j]==2)&&(state[i-4][j]==2))||
                                   ((state[i-1][j+1]==1)&&(state[i][j]==0)&&(state[i+1][j-1]==2)&&(state[i+2][j-2]==2)&&(state[i+3][j-3]==2)&&(state[i+4][j-4]==2))||
                                   ((state[i+1][j-1]==1)&&(state[i][j]==0)&&(state[i-1][j+1]==2)&&(state[i-2][j+2]==2)&&(state[i-3][j+3]==2)&&(state[i-4][j+4]==2))){
                                   value[i][j]=5;
                                   return value[i][j];
                 }
                 else if(((state[i][j]==0)&&(state[i][j+1]==1)&&(state[i][j+2]==1)&&(state[i][j+3]==0))||
                                 ((state[i][j]==0)&&(state[i][j-1]==1)&&(state[i][j-2]==1)&&(state[i][j-3]==0))||
                                 ((state[i][j]==0)&&(state[i+1][j]==1)&&(state[i+2][j]==1)&&(state[i+3][j]==0))||
                                 ((state[i][j]==0)&&(state[i-1][j]==1)&&(state[i-2][j]==1)&&(state[i-3][j]==0))||                            //空红红空型
                                 ((state[i][j]==0)&&(state[i+1][j+1]==1)&&(state[i+2][j+2]==1)&&(state[i+3][j+3]==0))||
                                 ((state[i][j]==0)&&(state[i+1][j-1]==1)&&(state[i+2][j-2]==1)&&(state[i+3][j-3]==0))||
                                 ((state[i][j]==0)&&(state[i-1][j+1]==1)&&(state[i-2][j+2]==1)&&(state[i-3][j+3]==0))||
                                 ((state[i][j]==0)&&(state[i-1][j-1]==1)&&(state[i-2][j-2]==1)&&(state[i-3][j-3]==0))||

精彩图集

赞助商链接