java五子棋练习题

港控/mmm° 2023-10-13 16:14 28阅读 0赞

## java五子棋练习题 ##

### 实现思路 ###

*  初始化棋盘 把棋盘初始化
    
        static String white = "☆";
            static String black = "★";
            static String[][] qp = new String[15][15];//棋盘
            static String[] num = {
              "⒈", "⒉", "⒊", "⒋", "⒌", "⒍", "⒎", "⒏", "⒐", "⒑", "⒒", "⒓", "⒔", "⒕", "⒖"};
            static String line = "十";
            //初始化棋盘
            public static void init() {
              
                int n = 0;
                for (int i = 0; i < qp.length; i++) {
              
                    //遍历每一行棋盘
                    for (int j = 0; j < qp.length; j++) {
              
                        if (i != 14 && j == 14) {
              
                            qp[i][j] = num[n];
                            n++;
                        } else if (i == 14) {
              
                            qp[i][j] = num[j];
                        } else {
              
                            qp[i][j] = line;
                        }
                    }
                }
            }
    
    **如下**

![在这里插入图片描述][9b608341db024afd82ff2e09a72a1835.png_pic_center]

*  因为每次下完棋都需要再次打印棋盘，所以我们创建一个打印棋盘方法(就是简单的遍历二维数组)

public static void print() {
        
            for (int i = 0; i < qp.length; i++) {
        
                for (int j = 0; j < qp.length; j++) {
        
                    System.out.print(qp[i][j]);
                }
                System.out.println();
            }
        }

*  下来就需要一个下棋的方法(注释如下)
 *  **注**：需要判断下棋位置是否出界，是否重下在同一个位置

import java.util.Scanner;
    	static int x = 0;
        static int y = 0;//坐标
        static boolean player1 = false;//黑棋玩家
        static boolean player2 = false;//白棋玩家
        //黑白双方交互下棋
        static Scanner in = new Scanner(System.in);
        public static void startGame() {
        
            System.out.println("游戏开始");
            boolean count = true;//定义一个计数器，区别黑白下棋；true-黑棋 false-白棋
            while (true) {
        
                if (count) {
        //黑棋
                    System.out.println("黑棋下");
                    System.out.println("输入坐标：");
                    put();//放置棋子
                    if (y < 0 || x < 0 || x > qp.length-1 || y > qp.length-1) {
        
                        System.out.println("下到棋盘外了。重新输入");
                        continue;
                    }
                    if (qp[x - 1][y - 1] == black || qp[x - 1][y - 1] == white) {
        //判断是否下棋重复
                        System.out.println("输入坐标重复，请重新输入");
                        continue;
                    }
    
                    qp[x - 1][y - 1] = black;
                    print();
                    count = false;
                } else {
        //白棋
                    System.out.println("白棋下");
                    System.out.println("输入坐标：");
                    put();//放置棋子
                    if (y < 0 || x < 0 || x > qp.length-1 || y > qp.length-1) {
        
                        System.out.println("下到棋盘外了，重新输入");
                        continue;
                    }
                    if (qp[x - 1][y - 1] == black || qp[x - 1][y - 1] == white) {
        //判断是否下棋重复
                        System.out.println("输入坐标重复，请重新输入");
                        continue;
                    }
    
                    qp[x - 1][y - 1] = white;
                    print();
                    count = true;
                }
                //判断输赢
                Winner();
                if(player1==true||player2==true){
        
                    break;//某一方玩家获胜，即游戏结束
                }
            }
        }
        public static void put() {
        //放置棋子
            x = in.nextInt();
            y = in.nextInt();
        }

*  下棋肯定需要判断哪一方输赢，所以需要一个判断输赢的方法
 *  赢法共四种 1.横向 2.纵向 3.右斜 4.左斜 需要分开去判断

//判断输赢
        public static void Winner() {
        
            for (int i = 0; i < qp.length; i++) {
        
                for (int j = 0; j < qp[i].length; j++) {
        
                    //横向
                    if (j < qp[i].length - 4) {
        
                        if (qp[i][j] == qp[i][j+1] && qp[i][j+1] == qp[i][j+2] && qp[i][j+2] == qp[i][j+3] && qp[i][j+3]==qp[i][j+4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利！");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利！");
                                player2=true;
                                return;
                            }
                        }
                    }
                    //纵向
                    if (i < qp.length - 4 ) {
        
                        if (qp[i][j] == qp[i+1][j] && qp[i+1][j] == qp[i+2][j] && qp[i+2][j] == qp[i+3][j] && qp[i+3][j]==qp[i+4][j] ) {
        
                           if(qp[i][j]==black){
        
                               System.out.println("黑棋胜利");
                               player1=true;
                               return;
                           }
                           if(qp[i][j]==white){
        
                               System.out.println("白棋胜利");
                               player2=true;
                               return;
                           }
                        }
                    }
                    //  /这种斜
                    if(i<qp.length-4&&j< qp.length-4){
        
                        if(qp[i][j]==qp[i+1][j+1]&&qp[i+1][j+1]==qp[i+2][j+2]&&qp[i+2][j+2]==qp[i+3][j+3]&&qp[i+3][j+3]==qp[i+4][j+4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利");
                                player2=true;
                                return;
                            }
                        }
                    }
                    // \这种斜
                    if(i<qp.length-4&&j>4){
        
                        if(qp[i][j]==qp[i+1][j-1]&&qp[i+1][j-1]==qp[i+2][j-2]&&qp[i+2][j-2]==qp[i+3][j-3]&&qp[i+3][j-3]==qp[i+4][j-4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利");
                                player2=true;
                                return;
                            }
                        }
                    }
                }
            }

*  把这些方法都放在一个类中，整理可知

package day4;
    
    import java.util.Scanner;
    
    /*
     * 五子棋
     * 1.初始化棋盘
     * 2.黑白双方交互下棋
     *3.检测输赢，防止重复下棋
     */
    public class WZQ {
        
        static String white = "☆";
        static String black = "★";
        static String[][] qp = new String[15][15];
        static String[] num = {
        "⒈", "⒉", "⒊", "⒋", "⒌", "⒍", "⒎", "⒏", "⒐", "⒑", "⒒", "⒓", "⒔", "⒕", "⒖"};
        static String line = "十";
        //初始化棋盘
        public static void init() {
        
            int n = 0;
            for (int i = 0; i < qp.length; i++) {
        
                //遍历每一行棋盘
                for (int j = 0; j < qp.length; j++) {
        
                    if (i != 14 && j == 14) {
        
                        qp[i][j] = num[n];
                        n++;
                    } else if (i == 14) {
        
                        qp[i][j] = num[j];
                    } else {
        
                        qp[i][j] = line;
                    }
                }
            }
        }
        //打印棋盘
        public static void print() {
        
            for (int i = 0; i < qp.length; i++) {
        
                for (int j = 0; j < qp.length; j++) {
        
                    System.out.print(qp[i][j]);
                }
                System.out.println();
            }
        }
        static int x = 0;
        static int y = 0;//坐标
        static boolean player1 = false;
        static boolean player2 = false;
        //黑白双方交互下棋
        static Scanner in = new Scanner(System.in);
        public static void startGame() {
        
            System.out.println("游戏开始");
            boolean count = true;//定义一个计数器，区别黑白下棋；
            while (true) {
        
                if (count) {
        //黑棋
                    System.out.println("黑棋下");
                    System.out.println("输入坐标：");
                    put();//放置棋子
                    if (y < 0 || x < 0 || x > qp.length-1 || y > qp.length-1) {
        
                        System.out.println("下到棋盘外了。重新输入");
                        continue;
                    }
                    if (qp[x - 1][y - 1] == black || qp[x - 1][y - 1] == white) {
        //判断是否下棋重复
                        System.out.println("输入坐标重复，请重新输入");
                        continue;
                    }
    
                    qp[x - 1][y - 1] = black;
                    print();
                    count = false;
                } else {
        //白棋
                    System.out.println("白棋下");
                    System.out.println("输入坐标：");
                    put();//放置棋子
                    if (y < 0 || x < 0 || x > qp.length-1 || y > qp.length-1) {
        
                        System.out.println("下到棋盘外了。重新输入");
                        continue;
                    }
                    if (qp[x - 1][y - 1] == black || qp[x - 1][y - 1] == white) {
        //判断是否下棋重复
                        System.out.println("输入坐标重复，请重新输入");
                        continue;
                    }
    
                    qp[x - 1][y - 1] = white;
                    print();
                    count = true;
                }
                //判断输赢
                Winner();
                if(player1==true||player2==true){
        
                    break;
                }
            }
        }
        public static void put() {
        //放置棋子
            x = in.nextInt();
            y = in.nextInt();
        }
        //判断输赢
        public static void Winner() {
        
            for (int i = 0; i < qp.length; i++) {
        
                for (int j = 0; j < qp[i].length; j++) {
        
                    //横向
                    if (j < qp[i].length - 4) {
        
                        if (qp[i][j] == qp[i][j+1] && qp[i][j+1] == qp[i][j+2] && qp[i][j+2] == qp[i][j+3] && qp[i][j+3]==qp[i][j+4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利！");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利！");
                                player2=true;
                                return;
                            }
                        }
                    }
                    //纵向
                    if (i < qp.length - 4 ) {
        
                        if (qp[i][j] == qp[i+1][j] && qp[i+1][j] == qp[i+2][j] && qp[i+2][j] == qp[i+3][j] && qp[i+3][j]==qp[i+4][j] ) {
        
                           if(qp[i][j]==black){
        
                               System.out.println("黑棋胜利");
                               player1=true;
                               return;
                           }
                           if(qp[i][j]==white){
        
                               System.out.println("白棋胜利");
                               player2=true;
                               return;
                           }
                        }
                    }
                    //  /这种斜
                    if(i<qp.length-4&&j< qp.length-4){
        
                        if(qp[i][j]==qp[i+1][j+1]&&qp[i+1][j+1]==qp[i+2][j+2]&&qp[i+2][j+2]==qp[i+3][j+3]&&qp[i+3][j+3]==qp[i+4][j+4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利");
                                player2=true;
                                return;
                            }
                        }
                    }
                    // \这种斜
                    if(i<qp.length-4&&j>4){
        
                        if(qp[i][j]==qp[i+1][j-1]&&qp[i+1][j-1]==qp[i+2][j-2]&&qp[i+2][j-2]==qp[i+3][j-3]&&qp[i+3][j-3]==qp[i+4][j-4]){
        
                            if(qp[i][j]==black){
        
                                System.out.println("黑棋胜利");
                                player1=true;
                                return;
                            }
                            if(qp[i][j]==white){
        
                                System.out.println("白棋胜利");
                                player2=true;
                                return;
                            }
                        }
                    }
                }
            }
        }
    }

*  则再写一个启动的类，来运行这些方法

package day4;
    
    import java.util.Scanner;
    
    public class WzqRun {
        
        public static void main(String[] args) {
        
            Scanner in=new Scanner(System.in);
            while(true){
        
                System.out.println("欢迎使用五子棋系统");
                System.out.println("1.开始游戏");
                System.out.println("2.退出游戏");
                System.out.println("输入1~2");
                int choose = in.nextInt();
                switch (choose){
        
    
                    case 1:WZQ.init();WZQ.print();WZQ.startGame();break;
                    case 2: return;
                }
            }
        }
    }

![在这里插入图片描述][7acfafa22ef54f428f2a86683935b2e3.png_pic_center]

![在这里插入图片描述][548dc91ee6b2464e8a86b74640c8d3e6.png_pic_center]

**以上就是五子棋的实现思路**

[9b608341db024afd82ff2e09a72a1835.png_pic_center]: https://img-blog.csdnimg.cn/9b608341db024afd82ff2e09a72a1835.png#pic_center
[7acfafa22ef54f428f2a86683935b2e3.png_pic_center]: https://img-blog.csdnimg.cn/7acfafa22ef54f428f2a86683935b2e3.png#pic_center
[548dc91ee6b2464e8a86b74640c8d3e6.png_pic_center]: https://img-blog.csdnimg.cn/548dc91ee6b2464e8a86b74640c8d3e6.png#pic_center