Java实现两人五子棋游戏(五)判断是否有一方胜出
之前的两篇文章：Java实现两人五子棋游戏(二) 画出棋盘；Java实现两人五子棋游戏(三) 画出棋子；Java实现两人五子棋游戏(四) 落子动作的实现，可以点击查看。
公司主营业务：网站设计、做网站、移动网站开发等业务。帮助企业客户真正实现互联网宣传，提高企业的竞争能力。成都创新互联公司是一支青春激扬、勤奋敬业、活力青春激扬、勤奋敬业、活力澎湃、和谐高效的团队。公司秉承以“开放、自由、严谨、自律”为核心的企业文化，感谢他们对我们的高要求，感谢他们从不同领域给我们带来的挑战，让我们激情的团队有机会用头脑与智慧不断的给客户带来惊喜。成都创新互联公司推出湘东免费做网站回馈大家。
前面我们已经画好了棋盘、棋子并且可以自由的落子了，那么接下来要实现的功能是判断是否有五连珠（暂时不考虑行棋方）。
我们采用遍历棋盘已经落子的位置，查看每个落子点，在它的上下，左右，左下右上，左上右下四个方向的任一方向上是否有五个连续的棋子。
第一步，对棋子类进行改造，之前我们的棋子类只有颜色信息和落子状态，现在要新增一个int型的数据，用于记录遍历过程中当前有几个珠子已知连续。
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函数，用遍历整个棋盘上的有效棋子的方式，来进行胜出判断。
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=x && point_x<=x+imgWidth && point_y>=y && point_y <= y+imgHeight)
{
//System.out.println("合法");
for(int i=0;i=x-chessman_width/2+1+i*span_x)
{
if(point_x<=x+chessman_width/2-1+i*span_x)//如果是width/2会在中间点出现两个匹配值
{
//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=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
//当用户按下并松开鼠标按钮时发生
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;//记录连珠的数目
//横向查找
for(int i=0;i=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;
}
}
}
//向左侧查找
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标题
setTitle("单机五子棋");
Container containerPane =getContentPane();
containerPane.add(drawChessBoard);
}
public static void main(String[] args) {
Main m = new Main();
m.setSize(800, 800);
m.setVisible(true);
}
}
第四步，现在我们一个方向上的判断已经做好了，接下来补全其他三个方向上的判断代码
补足DrawChessBoard.java中的isWin()函数
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=x && point_x<=x+imgWidth && point_y>=y && point_y <= y+imgHeight)
{
//System.out.println("合法");
for(int i=0;i=x-chessman_width/2+1+i*span_x)
{
if(point_x<=x+chessman_width/2-1+i*span_x)//如果是width/2会在中间点出现两个匹配值
{
//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=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
//当用户按下并松开鼠标按钮时发生
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=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;
}
}
}
//向左侧查找
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=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=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=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实现两人五子棋游戏(五)判断是否有一方胜出
文章转载：http://hbruida.cn/article/jhjsde.html
