欧美一区二区三区老妇人-欧美做爰猛烈大尺度电-99久久夜色精品国产亚洲a-亚洲福利视频一区二区

Java實現(xiàn)兩人五子棋游戲(五)判斷是否有一方勝出

之前的兩篇文章：Java實現(xiàn)兩人五子棋游戲(二) 畫出棋盤；Java實現(xiàn)兩人五子棋游戲(三) 畫出棋子；Java實現(xiàn)兩人五子棋游戲(四) 落子動作的實現(xiàn)，可以點擊查看。

公司主營業(yè)務(wù)：網(wǎng)站設(shè)計、做網(wǎng)站、移動網(wǎng)站開發(fā)等業(yè)務(wù)。幫助企業(yè)客戶真正實現(xiàn)互聯(lián)網(wǎng)宣傳，提高企業(yè)的競爭能力。成都創(chuàng)新互聯(lián)公司是一支青春激揚、勤奮敬業(yè)、活力青春激揚、勤奮敬業(yè)、活力澎湃、和諧高效的團隊。公司秉承以“開放、自由、嚴謹、自律”為核心的企業(yè)文化，感謝他們對我們的高要求，感謝他們從不同領(lǐng)域給我們帶來的挑戰(zhàn)，讓我們激情的團隊有機會用頭腦與智慧不斷的給客戶帶來驚喜。成都創(chuàng)新互聯(lián)公司推出湘東免費做網(wǎng)站回饋大家。

Java實現(xiàn)兩人五子棋游戲(五) 判斷是否有一方勝出

前面我們已經(jīng)畫好了棋盤、棋子并且可以自由的落子了，那么接下來要實現(xiàn)的功能是判斷是否有五連珠（暫時不考慮行棋方）。

我們采用遍歷棋盤已經(jīng)落子的位置，查看每個落子點，在它的上下，左右，左下右上，左上右下四個方向的任一方向上是否有五個連續(xù)的棋子。

第一步，對棋子類進行改造，之前我們的棋子類只有顏色信息和落子狀態(tài)，現(xiàn)在要新增一個int型的數(shù)據(jù)，用于記錄遍歷過程中當(dāng)前有幾個珠子已知連續(xù)。

Java實現(xiàn)兩人五子棋游戲(五) 判斷是否有一方勝出

Chessman.java

package xchen.test.simpleGobang; 
 
public class Chessman { 
  private int color;//1-white，0-black 
  private boolean placed = false; 
  int matchCount = 1; 
   
  public Chessman(int color,boolean placed){ 
    this.color=color; 
    this.placed=placed; 
  } 
   
  public boolean getPlaced() { 
    return placed; 
  } 
 
  public void setPlaced(boolean placed) { 
    this.placed = placed; 
  } 
 
  public int getColor() { 
    return color; 
  } 
 
  public void setColor(int color) { 
    this.color = color; 
  } 
}

第二步，先從一個方向上判斷是否有五連珠，這里采用左右方向作為嘗試。

添加了一個isWin函數(shù)，用遍歷整個棋盤上的有效棋子的方式，來進行勝出判斷。

DrawChessBoard.java

package xchen.test.simpleGobang; 
 
import java.awt.Graphics; 
import java.awt.Graphics2D; 
import java.awt.RadialGradientPaint; 
import java.awt.Image; 
import java.awt.Toolkit; 
import java.awt.event.MouseEvent; 
import java.awt.event.MouseListener; 
import java.awt.Color; 
import javax.swing.JPanel; 
 
public class DrawChessBoard extends JPanel implements MouseListener{ 
  final static int BLACK=0; 
  final static int WHITE=1; 
  public int chessColor = BLACK; 
  int chessman_width=30; 
   
  public Image boardImg; 
  final private int ROWS = 19; 
  Chessman[][] chessStatus=new Chessman[ROWS+1][ROWS+1];  
   
  public DrawChessBoard() { 
    boardImg = Toolkit.getDefaultToolkit().getImage("res/drawable/chessboard2.png"); 
    if(boardImg == null) 
      System.err.println("png do not exist"); 
     
    addMouseListener(this); 
  }   
  @Override 
  protected void paintComponent(Graphics g) { 
    // TODO Auto-generated method stub 
    super.paintComponent(g); 
     
    int imgWidth = boardImg.getHeight(this); 
    int imgHeight = boardImg.getWidth(this); 
    int FWidth = getWidth(); 
    int FHeight= getHeight(); 
     
    int x=(FWidth-imgWidth)/2; 
    int y=(FHeight-imgHeight)/2; 
     
    int span_x=imgWidth/ROWS; 
    int span_y=imgHeight/ROWS; 
     
    g.drawImage(boardImg, x, y, null); 
     
    //畫橫線 
    for(int i=0;i<ROWS;i++) 
    { 
      g.drawLine(x, y+i*span_y, FWidth-x,y+i*span_y); 
    } 
    //畫豎線 
    for(int i=0;i<ROWS;i++) 
    { 
      g.drawLine(x+i*span_x, y, x+i*span_x,FHeight-y); 
    } 
     
    //畫棋子 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //System.out.println("draw chessman "+i+" "+j); 
          int pos_x=x+i*span_x; 
          int pos_y=y+j*span_y; 
          float radius_b=40; 
          float radius_w=80; 
          float[] fractions = new float[]{0f,1f}; 
          java.awt.Color[] colors_b = new java.awt.Color[]{Color.BLACK,Color.WHITE}; 
          Color[] colors_w = new Color[]{Color.WHITE,Color.BLACK}; 
          RadialGradientPaint paint; 
          if(chessStatus[i][j].getColor()==1) 
          { 
            //System.out.println("draw white chess"); 
            paint = new RadialGradientPaint(pos_x-chessman_width/2f, pos_y-chessman_width/2f, radius_w*2, fractions, colors_w); 
          }else{ 
            //System.out.println("draw black chess"); 
            paint = new RadialGradientPaint(pos_x-chessman_width/2f, pos_y-chessman_width/2f, radius_b*2, fractions, colors_b); 
          } 
          ((Graphics2D)g).setPaint(paint); 
           
          ((Graphics2D)g).fillOval(pos_x-chessman_width/2,pos_y-chessman_width/2,chessman_width,chessman_width); 
        } 
      } 
    } 
  } 
   
  @Override 
  //當(dāng)用戶按下鼠標(biāo)按鈕時發(fā)生 
  public void mousePressed(MouseEvent e) { 
    int point_x=e.getX(); 
    int point_y=e.getY(); 
     
    int imgWidth = boardImg.getHeight(this); 
    int imgHeight = boardImg.getWidth(this); 
    int FWidth = getWidth(); 
    int FHeight= getHeight(); 
     
    int x=(FWidth-imgWidth)/2; 
    int y=(FHeight-imgHeight)/2; 
     
    int span_x=imgWidth/ROWS; 
    int span_y=imgHeight/ROWS; 
     
    //System.out.println("press"); 
    int status_x = 0; 
    int status_y = 0; 
    if(point_x>=x && point_x<=x+imgWidth && point_y>=y && point_y <= y+imgHeight) 
    { 
      //System.out.println("合法"); 
      for(int i=0;i<ROWS+1;i++) 
      { 
        if(point_x>=x-chessman_width/2+1+i*span_x) 
        { 
          if(point_x<=x+chessman_width/2-1+i*span_x)//如果是width/2會在中間點出現(xiàn)兩個匹配值 
          { 
            //System.out.println("point x "+i+" "+point_x+" "+(x-chessman_width/2+i*span_x)+" "+(x+chessman_width/2+i*span_x)); 
            status_x = i; 
          } 
        } 
      } 
      for(int i=0;i<ROWS+1;i++) 
      { 
        if(point_y>=y-chessman_width/2+1+i*span_y) 
        { 
          if(point_y <= y+chessman_width/2-1+i*span_y) 
          { 
            //System.out.println("point y "+i+" "+point_y+" "+(y-chessman_width/2+1+i*span_y)+" "+(y+chessman_width/2-1+i*span_y)); 
            status_y = i; 
          } 
        } 
      } 
      Chessman chessman = new Chessman(BLACK, true); 
      chessStatus[status_x][status_y]=chessman; 
      repaint(); 
      if(isWin(status_x, status_y, chessStatus)) 
      { 
        System.out.println("WIN!!!!!"); 
      } 
    } 
  } 
  @Override 
  //當(dāng)用戶按下并松開鼠標(biāo)按鈕時發(fā)生 
  public void mouseClicked(MouseEvent e) { 
    // TODO Auto-generated method stub 
  } 
  @Override 
  public void mouseReleased(MouseEvent e) { 
    // TODO Auto-generated method stub 
     
  } 
  @Override 
  public void mouseEntered(MouseEvent e) { 
    // TODO Auto-generated method stub 
     
  } 
  @Override 
  public void mouseExited(MouseEvent e) { 
    // TODO Auto-generated method stub  
  } 
   
  boolean isWin(int point_x,int point_y,Chessman[][] cm) 
  { 
    //int matchCount = 1;//記錄連珠的數(shù)目 
     
    //橫向查找 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //System.out.println("isWin:"+i+" "+j); 
          //向右側(cè)查找 
          for(int n=1;n<=4;n++) 
          { 
            if((i+n>=0)&&(i+n)<=ROWS) 
            { 
              if(chessStatus[i+n][j]!=null&&chessStatus[i+n][j].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" right count++:"+(i+n)+" "+j+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                break; 
              }   
            } 
          } 
          //向左側(cè)查找 
          for(int n=1;n<=4;n++) 
          { 
            if((i-n>=0)&&(i-n)<=ROWS) 
            { 
              if(chessStatus[i-n][j]!=null&&chessStatus[i-n][j].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" "+"left count++:"+(i-n)+" "+j+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                if(chessStatus[i-n][j]!=null) 
                { 
                  chessStatus[i][j].matchCount = 1; 
                } 
                break; 
              } 
            } 
          } 
          chessStatus[i][j].matchCount=1;//refresh count 
        } 
      } 
    } 
    return false; 
     
  } 
}

第三步，主模塊不變，運行測試一下我們的算法是否正確

Main.java

package xchen.test.simpleGobang; 
 
import java.awt.Container; 
import javax.swing.JFrame; 
 
import xchen.test.simpleGobang.DrawChessBoard; 
 
public class Main extends JFrame{ 
  private DrawChessBoard drawChessBoard; 
  public Main() {    
    drawChessBoard = new DrawChessBoard(); 
     
    //Frame標(biāo)題 
    setTitle("單機五子棋"); 
     
    Container containerPane =getContentPane(); 
    containerPane.add(drawChessBoard);    
  } 
  public static void main(String[] args) { 
    Main m = new Main(); 
    m.setSize(800, 800); 
    m.setVisible(true); 
  } 
}

Java實現(xiàn)兩人五子棋游戲(五) 判斷是否有一方勝出

第四步，現(xiàn)在我們一個方向上的判斷已經(jīng)做好了，接下來補全其他三個方向上的判斷代碼

補足DrawChessBoard.java中的isWin()函數(shù)

package xchen.test.simpleGobang; 
 
import java.awt.Color; 
import java.awt.Graphics; 
import java.awt.Graphics2D; 
import java.awt.Image; 
import java.awt.RadialGradientPaint; 
import java.awt.Toolkit; 
import java.awt.event.MouseEvent; 
import java.awt.event.MouseListener; 
 
import javax.swing.JPanel; 
 
public class DrawChessBoard extends JPanel implements MouseListener{ 
  final static int BLACK=0; 
  final static int WHITE=1; 
  public int chessColor = BLACK; 
  int chessman_width=30; 
 
  public Image boardImg; 
  final private int ROWS = 19; 
  Chessman[][] chessStatus=new Chessman[ROWS+1][ROWS+1];  
 
  public DrawChessBoard() { 
    boardImg = Toolkit.getDefaultToolkit().getImage("res/drawable/chessboard2.png"); 
    if(boardImg == null) 
      System.err.println("png do not exist"); 
 
    addMouseListener(this); 
  }   
  @Override 
  protected void paintComponent(Graphics g) { 
    // TODO Auto-generated method stub 
    super.paintComponent(g); 
 
    int imgWidth = boardImg.getHeight(this); 
    int imgHeight = boardImg.getWidth(this); 
    int FWidth = getWidth(); 
    int FHeight= getHeight(); 
 
    int x=(FWidth-imgWidth)/2; 
    int y=(FHeight-imgHeight)/2; 
 
    int span_x=imgWidth/ROWS; 
    int span_y=imgHeight/ROWS; 
 
    g.drawImage(boardImg, x, y, null); 
 
    //畫橫線 
    for(int i=0;i<ROWS;i++) 
    { 
      g.drawLine(x, y+i*span_y, FWidth-x,y+i*span_y); 
    } 
    //畫豎線 
    for(int i=0;i<ROWS;i++) 
    { 
      g.drawLine(x+i*span_x, y, x+i*span_x,FHeight-y); 
    } 
 
    //畫棋子 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //System.out.println("draw chessman "+i+" "+j); 
          int pos_x=x+i*span_x; 
          int pos_y=y+j*span_y; 
          float radius_b=40; 
          float radius_w=80; 
          float[] fractions = new float[]{0f,1f}; 
          java.awt.Color[] colors_b = new java.awt.Color[]{Color.BLACK,Color.WHITE}; 
          Color[] colors_w = new Color[]{Color.WHITE,Color.BLACK}; 
          RadialGradientPaint paint; 
          if(chessStatus[i][j].getColor()==1) 
          { 
            //System.out.println("draw white chess"); 
            paint = new RadialGradientPaint(pos_x-chessman_width/2f, pos_y-chessman_width/2f, radius_w*2, fractions, colors_w); 
          }else{ 
            //System.out.println("draw black chess"); 
            paint = new RadialGradientPaint(pos_x-chessman_width/2f, pos_y-chessman_width/2f, radius_b*2, fractions, colors_b); 
          } 
          ((Graphics2D)g).setPaint(paint); 
 
          ((Graphics2D)g).fillOval(pos_x-chessman_width/2,pos_y-chessman_width/2,chessman_width,chessman_width); 
        } 
      } 
    } 
  } 
 
  @Override 
  //當(dāng)用戶按下鼠標(biāo)按鈕時發(fā)生 
  public void mousePressed(MouseEvent e) { 
    int point_x=e.getX(); 
    int point_y=e.getY(); 
 
    int imgWidth = boardImg.getHeight(this); 
    int imgHeight = boardImg.getWidth(this); 
    int FWidth = getWidth(); 
    int FHeight= getHeight(); 
 
    int x=(FWidth-imgWidth)/2; 
    int y=(FHeight-imgHeight)/2; 
 
    int span_x=imgWidth/ROWS; 
    int span_y=imgHeight/ROWS; 
 
    //System.out.println("press"); 
    int status_x = 0; 
    int status_y = 0; 
    if(point_x>=x && point_x<=x+imgWidth && point_y>=y && point_y <= y+imgHeight) 
    { 
      //System.out.println("合法"); 
      for(int i=0;i<ROWS+1;i++) 
      { 
        if(point_x>=x-chessman_width/2+1+i*span_x) 
        { 
          if(point_x<=x+chessman_width/2-1+i*span_x)//如果是width/2會在中間點出現(xiàn)兩個匹配值 
          { 
            //System.out.println("point x "+i+" "+point_x+" "+(x-chessman_width/2+i*span_x)+" "+(x+chessman_width/2+i*span_x)); 
            status_x = i; 
          } 
        } 
      } 
      for(int i=0;i<ROWS+1;i++) 
      { 
        if(point_y>=y-chessman_width/2+1+i*span_y) 
        { 
          if(point_y <= y+chessman_width/2-1+i*span_y) 
          { 
            //System.out.println("point y "+i+" "+point_y+" "+(y-chessman_width/2+1+i*span_y)+" "+(y+chessman_width/2-1+i*span_y)); 
            status_y = i; 
          } 
        } 
      } 
      Chessman chessman = new Chessman(BLACK, true); 
      chessStatus[status_x][status_y]=chessman; 
      repaint(); 
      if(isWin(status_x, status_y, chessStatus)) 
      { 
        System.out.println("WIN!!!!!"); 
      } 
    } 
  } 
  @Override 
  //當(dāng)用戶按下并松開鼠標(biāo)按鈕時發(fā)生 
  public void mouseClicked(MouseEvent e) { 
    // TODO Auto-generated method stub 
  } 
  @Override 
  public void mouseReleased(MouseEvent e) { 
    // TODO Auto-generated method stub 
 
  } 
  @Override 
  public void mouseEntered(MouseEvent e) { 
    // TODO Auto-generated method stub 
 
  } 
  @Override 
  public void mouseExited(MouseEvent e) { 
    // TODO Auto-generated method stub  
  } 
 
  boolean isWin(int point_x,int point_y,Chessman[][] cm) 
  {   
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        //橫向查找 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //向右側(cè)查找 
          for(int n=1;n<=4;n++) 
          { 
            if((i+n>=0)&&(i+n)<=ROWS) 
            { 
              if(chessStatus[i+n][j]!=null&&chessStatus[i+n][j].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" right count++:"+(i+n)+" "+j+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                break; 
              }   
            } 
          } 
          //向左側(cè)查找 
          for(int n=1;n<=4;n++) 
          { 
            if((i-n>=0)&&(i-n)<=ROWS) 
            { 
              if(chessStatus[i-n][j]!=null&&chessStatus[i-n][j].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" "+"left count++:"+(i-n)+" "+j+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                if(chessStatus[i-n][j]!=null) 
                { 
                  chessStatus[i][j].matchCount = 1; 
                } 
                break; 
              } 
            } 
          } 
          chessStatus[i][j].matchCount=1;//refresh count 
        } 
      } 
    } 
 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        //縱向 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //向下查找，左上角為坐標(biāo)原點，y軸正方向向下 
          for(int n=1;n<=4;n++) 
          { 
            if((j+n>=0)&&(j+n)<=ROWS) 
            { 
              if(chessStatus[i][j+n]!=null&&chessStatus[i][j+n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" up count++:"+(i)+" "+(j+n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                break; 
              }   
            } 
          } 
          //向上查找 
          for(int n=1;n<=4;n++) 
          { 
            if((j-n>=0)&&(j-n)<=ROWS) 
            { 
              if(chessStatus[i][j-n]!=null&&chessStatus[i][j-n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" "+"left count++:"+(i)+" "+(j-n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                if(chessStatus[i][j-n]!=null) 
                { 
                  chessStatus[i][j].matchCount = 1; 
                } 
                break; 
              } 
            } 
          } 
          chessStatus[i][j].matchCount=1;//refresh count 
        } 
      } 
    } 
 
    //方向：左上右下 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        //左上 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //向下查找，左上角為坐標(biāo)原點，y軸正方向向下 
          for(int n=1;n<=4;n++) 
          { 
            if((j-n>=0)&&(j-n)<=ROWS&&(i-n)>=0&&(i-n)<=ROWS) 
            { 
              if(chessStatus[i-n][j-n]!=null&&chessStatus[i-n][j-n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" up count++:"+(i-n)+" "+(j-n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                break; 
              }   
            } 
          } 
          //右下 
          for(int n=1;n<=4;n++) 
          { 
            if((j+n>=0)&&(j+n)<=ROWS&&(i+n)>=0&&(i+n)<=ROWS) 
            { 
              if(chessStatus[i+n][j+n]!=null&&chessStatus[i+n][j+n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" "+"left count++:"+(i+n)+" "+(j+n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                if(chessStatus[i+n][j+n]!=null) 
                { 
                  chessStatus[i][j].matchCount = 1; 
                } 
                break; 
              } 
            } 
          } 
          chessStatus[i][j].matchCount=1;//refresh count 
        } 
      } 
    } 
 
    //方向：左下右上 
    for(int i=0;i<ROWS+1;i++) 
    { 
      for(int j=0;j<ROWS+1;j++) 
      { 
        //左下 
        if(chessStatus[i][j]!=null&&chessStatus[i][j].getPlaced()==true) 
        { 
          //向下查找，左上角為坐標(biāo)原點，y軸正方向向下 
          for(int n=1;n<=4;n++) 
          { 
            if((j+n>=0)&&(j+n)<=ROWS&&(i-n)>=0&&(i-n)<=ROWS) 
            { 
              if(chessStatus[i-n][j+n]!=null&&chessStatus[i-n][j+n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" up count++:"+(i-n)+" "+(j+n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                break; 
              }   
            } 
          } 
          //右上 
          for(int n=1;n<=4;n++) 
          { 
            if((j-n>=0)&&(j-n)<=ROWS&&(i+n)>=0&&(i+n)<=ROWS) 
            { 
              if(chessStatus[i+n][j-n]!=null&&chessStatus[i+n][j-n].getPlaced()==true) 
              { 
                chessStatus[i][j].matchCount++; 
                System.out.println("pos:"+i+" "+j+" "+"left count++:"+(i+n)+" "+(j-n)+" count:"+chessStatus[i][j].matchCount); 
                if(chessStatus[i][j].matchCount==5) 
                { 
                  return true; 
                } 
              }else 
              { 
                if(chessStatus[i+n][j-n]!=null) 
                { 
                  chessStatus[i][j].matchCount = 1; 
                } 
                break; 
              } 
            } 
          } 
          chessStatus[i][j].matchCount=1;//refresh count 
        } 
      } 
    }     
 
    return false;   
  } 
}

再運行一下

Java實現(xiàn)兩人五子棋游戲(五) 判斷是否有一方勝出

以上就是本文的全部內(nèi)容，希望對大家的學(xué)習(xí)有所幫助，也希望大家多多支持創(chuàng)新互聯(lián)。

當(dāng)前名稱：Java實現(xiàn)兩人五子棋游戲(五)判斷是否有一方勝出
瀏覽地址：http://chinadenli.net/article14/jhjsde.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供Google、網(wǎng)站營銷、用戶體驗、微信公眾號、電子商務(wù)、網(wǎng)站制作

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請盡快告知，我們將會在第一時間刪除。文章觀點不代表本網(wǎng)站立場，如需處理請聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時需注明來源： 創(chuàng)新互聯(lián)

搜索引擎優(yōu)化