「java简单五子棋」java实现五子棋思路

博主:adminadmin 2023-01-22 23:39:07 284

本篇文章给大家谈谈java简单五子棋,以及java实现五子棋思路对应的知识点,希望对各位有所帮助,不要忘了收藏本站喔。

本文目录一览:

求一个简单的JAVA五子棋代码!! 网上复制的别来了!

以下是现写的 实现了两人对战 自己复制后运行把 没什么难度 类名 Games

import java.util.Scanner;

public class Games {

private String board[][];

private static int SIZE = 17;

private static String roles = "A玩家";

//初始化数组

public void initBoard() {

board = new String[SIZE][SIZE];

for (int i = 0; i SIZE; i++) {

for (int j = 0; j SIZE; j++) {

// if(i==0){

// String str = "";

// str += j+" ";

// board[i][j]= str;

// }else if(i!=0j==0){

// String str = "";

// str += i+" ";

// board[i][j]= str;

// }else{

board[i][j] = "╋";

// }

}

}

}

//输出棋盘

public void printBoard() {

for (int i = 0; i SIZE; i++) {

for (int j = 0; j SIZE; j++) {

System.out.print(board[i][j]);

}

System.out.println();

}

}

//判断所下棋子位置是否合理

public boolean isOk(int x, int y) {

boolean isRight = true;

if (x = 16 || x 1 || y = 16 | y 1) {

//System.out.println("输入错误,请从新输入");

isRight = false;

}

if (board[x][y].equals("●") || board[x][y].equals("○")) {

isRight = false;

}

return isRight;

}

//判断谁赢了

public void whoWin(Games wz) {

// 从数组挨个查找找到某个类型的棋子就从该棋子位置向右,向下,斜向右下 各查找5连续的位置看是否为5个相同的

int xlabel;// 记录第一次找到某个棋子的x坐标

int ylabel;// 记录第一次找到某个棋子的y坐标

// ●○╋

// 判断人是否赢了

for (int i = 0; i SIZE; i++) {

for (int j = 0; j SIZE; j++) {

if (board[i][j].equals("○")) {

xlabel = i;

ylabel = j;

// 横向找 x坐标不变 y坐标以此加1连成字符串

String heng = "";

if (i + 5 SIZE j + 5 SIZE) {

for (int k = j; k j + 5; k++) {

heng += board[i][k];

}

if (heng.equals("○○○○○")) {

System.out.println(roles+"赢了!您输了!");

System.exit(0);

}

// 向下判断y不变 x逐增5 连成字符串

String xia = "";

for (int l = j; l i + 5; l++) {

xia += board[l][j];

// System.out.println(xia);

}

if (xia.equals("○○○○○")) {

System.out.println(roles+"赢了!您输了!");

System.exit(0);

}

// 斜向右下判断

String youxia = "";

for (int a = 1; a = 5; a++) {

youxia += board[xlabel++][ylabel++];

}

if (youxia.equals("○○○○○")) {

System.out.println(roles+"赢了!您输了!");

System.exit(0);

}

}

}

}

}

// 判断电脑是否赢了

for (int i = 0; i SIZE; i++) {

for (int j = 0; j SIZE; j++) {

if (board[i][j].equals("●")) {

xlabel = i;

ylabel = j;

// 横向找 x坐标不变 y坐标以此加1连成字符串

String heng = "";

if (j + 5 SIZE i + 5 SIZE) {

for (int k = j; k j + 5; k++) {

heng += board[i][k];

}

if (heng.equals("●●●●●")) {

System.out.println(roles+"赢输了!您输了!");

System.exit(0);

}

// 向下判断y不变 x逐增5 连成字符串

String xia = "";

for (int l = i; l i + 5; l++) {

xia += board[l][ylabel];

// System.out.println(xia);

}

if (xia.equals("●●●●●")) {

System.out.println(roles+"赢了!您输了!");

System.exit(0);

}

// 斜向右下判断

String youxia = "";

for (int a = 1; a = 5; a++) {

youxia += board[xlabel++][ylabel++];

}

if (youxia.equals("●●●●●")) {

System.out.println(roles+"赢了!您输了!");

System.exit(0);

}

}

}

}

}

}

public static void main(String[] args) {

Games wz = new Games();

Scanner sc = new Scanner(System.in);

wz.initBoard();

wz.printBoard();

while (true) {

System.out.print("请"+roles+"输入X,Y坐标,必须在0-15范围内,xy以空格隔开,输入16 16结束程序");

int x = sc.nextInt();

int y = sc.nextInt();

if (x == SIZE y == SIZE) {

System.out.println("程序结束");

System.exit(0);

}

if (x SIZE || x 0 || y SIZE | y 0) {

System.out.println("输入错误,请从新输入");

continue;

}

//如果roles是A玩家 就让A玩家下棋,否则就让B玩家下棋。

if (wz.board[x][y].equals("╋")roles.equals("A玩家")) {

wz.board[x][y] = "○";

wz.printBoard();

//判断输赢

wz.whoWin(wz);

}else if(wz.board[x][y].equals("╋")roles.equals("B玩家")){

wz.board[x][y] = "●";

wz.printBoard();

//判断输赢

wz.whoWin(wz);

} else {

System.out.println("此处已经有棋子,从新输入");

continue;

}

if(roles.equals("A玩家")){

roles = "B玩家";

}else if(roles.equals("B玩家")){

roles = "A玩家";

}

}

}

}

用eclipse编写一个基于java的五子棋(与电脑对弈)

基于java的五子棋:

主要功能代码如下:

import java.awt.*;

import javax.swing.*;

import java.awt.event.*;

public class Main extends JFrame implements ActionListener{

        private static final long serialVersionUID = 1L;

        JButton[][] point=new JButton[40][40];

        int[][] state=new int[40][40];

        int[][] value=new int[40][40];

        int[] place=new int[2];

        public Main(){

                this.setTitle("五子棋");

                this.setBounds(100,10,1000,1000);

                this.setLayout(new GridLayout(30,30));

                int i,j;

                for(i=0;i=39;i++){

                        for(j=0;j=39;j++){

                                state[i][j]=0;

                                value[i][j]=0;

                        }

                }

                for(i=5;i=34;i++){

                        for (j=5;j=34;j++){

                                point[i][j]=new JButton("");

                                this.add(point[i][j]);

                                point[i][j].addActionListener(this);

                        }

                }

                this.setVisible(true);

        }

        public void actionPerformed(ActionEvent e)

    {

            int i,j;

            for(i=5;i=34;i++){

                    for(j=5;j=34;j++){

                            if(e.getSource()==point[i][j]){

                                    point[i][j].setBackground(Color.RED);

                                    state[i][j]=1;

                                    point[i][j].setEnabled(false);

                                    value[i][j]=0;

                            }

                    }

            }

          

    public static void main(String[] args)throws NullPointerException{

            new Main();

    }

                else if(((state[i][j]==0)(state[i][j+1]==1)(state[i][j+2]==0))||

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

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

                                ((state[i][j]==0)(state[i-1][j]==1)(state[i-2][j]==0))||                               //空红空

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

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

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

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

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

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

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

                                ((state[i][j]==0)(state[i-1][j]==1)(state[i-2][j]==1)(state[i-3][j]==2))||                            //空红红蓝型

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

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

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

                                ((state[i][j]==0)(state[i-1][j-1]==1)(state[i-2][j-2]==1)(state[i-3][j-3]==2))){

                                value[i][j]=2;

                                return value[i][j];

                }

                else if(((state[i][j]==0)(state[i][j+1]==2)(state[i][j+2]==0))||

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

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

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

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

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

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

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

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

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

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

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

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

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

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

                                ((state[i][j]==0)(state[i-1][j-1]==2)(state[i-2][j-2]==2)(state[i-3][j-3]==1))){

                                value[i][j]=1;

                                return value[i][j];

                }

                else{

                        value[i][j]=0;

                        return value[i][j];

                }

    }

    public int[] largestValue(int[][] value){

            int max,i,j,l,k;

            l=0;k=0;

            max=0;

            for(i=5;i34;i++){

                    for(j=5;j34;j++){

                            if(maxvalue[i][j]){

                                    max=value[i][j];

                                    place[0]=i;

                                    place[1]=j;

                            }

                    }

            }

            return place;

    }

}

运行结果如下图所示:

java五子棋怎么画ER图

先画正方形,然后画两条对折线完成。

第一步、我们先来画一画五子棋的棋盘,画出一个棋盘,画一个四方形。

第二步、接着我们画一画棋盘的棋盘格,横横竖竖的横要平,竖要直溜溜。

第三步、接着我们画出棋盘里面的棋子,黑色和白色的棋子就完成啦。

关于java简单五子棋和java实现五子棋思路的介绍到此就结束了,不知道你从中找到你需要的信息了吗 ?如果你还想了解更多这方面的信息,记得收藏关注本站。