scan.java

五子棋

public class Scan{
	int shape[][][]=new int[16][16][5];
 
   	void scan(int chesspad[][],int colour){//查看八方向上相邻同色棋子个数
     	int i,j;

        for(i=1;i<=15;i++){
        	for(j=1;j<=15;j++){
        		if(chesspad[i][j]==0){
                  	int m=i,n=j;
                	while(n-1>0&&chesspad[m][--n]==colour){//向上
                      	shape[i][j][0]++;
                 	}
                   	n=j;
                 	while(n+1<=15&&chesspad[m][++n]==colour){//向下
                      	shape[i][j][0]++;
                   	}          
                 	n=j;
                  	while(m-1>0&&chesspad[--m][n]==colour){//向左
                      	shape[i][j][1]++;
                  	}
                   	m=i;
                   	while(m+1<=15&&chesspad[++m][n]==colour){//向右
                   		shape[i][j][1]++;
                  	}	
                     	m=i;
                   	while(m-1>0&&n+1<=15&&chesspad[--m][++n]==colour){//左下
                       	shape[i][j][2]++;
                 	}
          		   	m=i;n=j; 
          		  	while(m+1<=15&&n-1>0&&chesspad[++m][--n]==colour){//右上
                       	shape[i][j][2]++;
                   	}
          		          
                  	m=i;n=j; 
                                  
                	while(m-1>=0&&n-1>0&&chesspad[--m][--n]==colour){//左上
                      	shape[i][j][3]++;
                 	}
          		   	m=i;n=j; 
          			while(m+1<=15&&n+1<=15&&chesspad[++m][++n]==colour){//右下
                      	shape[i][j][3]++;
                  	}
        		} 
        	}
   		}     
	} 
}