一个象棋手机游戏的源代码[6]

lectedX,selectedY);}
   
       }
    }
    protected void theRuleOfMa(int m,int n,int selectedX,int selectedY)//马的规则
    {
  if(n<9){
    if(point[n+1][m]==0)
    {
     if(selectedX-m==1){if(selectedY-n==2){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(n>0){
    if(point[n-1][m]==0)
    {
    if(m-selectedX==1){if(n-selectedY==2){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(n<9){
    if(point[n+1][m]==0)
    {
     if(selectedX-m==-1){if(selectedY-n==2){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(n>0){
    if(point[n-1][m]==0)
    {
    if(m-selectedX==-1){if(n-selectedY==2){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
        if(m<8){
    if(point[n][m+1]==0)
    {
     if(selectedX-m==2){if(selectedY-n==1){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(m>0){
    if(point[n][m-1]==0)
    {
    if(m-selectedX==2){if(n-selectedY==1){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(m<8){
    if(point[n][m+1]==0)
    {
     if(selectedX-m==2){if(selectedY-n==-1){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
  if(m>0){
    if(point[n][m-1]==0)
    {
    if(m-selectedX==2){if(n-selectedY==-1){changTwoChessNum(m,n,selectedX,selectedY);}}
    }
  }
    }
    protected void theRuleOfPao(int m,int n,int selectedX,int selectedY,int g1)//炮的规则
    {
      g=0;
        if(m==selectedX)
        {
       if(n>selectedY)
       {
         for(i=1;i         {
          if(point[selectedY+i][m]!=0){g++;}
         }
       }
       else
       {
         for(i=1;i         {
          if(point[n+i][m]!=0){g++;}
         }
       }
       if(g==g1){changTwoChessNum(m,n,selectedX,selectedY);}
   
       }
       if(n==selectedY)
       {
        if(m>selectedX)
       {
         for(i=1;i         {
          if(point[n][i+selectedX]!=0){g++;}
         }
       }
       else
       {
         for(i=1;i         {
          if(point[n][m+i]!=0){g++;}
         }
       }
       if(g==g1){changTwoChessNum(m,n,selectedX,selectedY);}
   
       }
    }
    protected void theRuleOfXiang(int m,int n,int selectedX,int selectedY)//相的规则
    {
  if(n<9&m<8){if(point[n+1][m+1]==0){if((selectedX-m==2)&(selectedY-n==2)){changTwoChessNum(m,n,selectedX,selectedY);}}}
  if(n>0&m<8){if(point[n-1][m+1]==0){if((selectedX-m==2)&(selectedY-n==-2)){changTwoChessNum(m,n,selectedX,selectedY);}}}
  if(n<9&m>0){if(point[n+1