package com.qf.test;
import java.util.Scanner;
public class Test01 {
public static void main(String[] args) {
//棋盘长度
int len = 20;
//棋盘容器
String[][] goBang = new String[len][len];
//棋盘符号
String[] nums = {"⒈","⒉","⒊","⒋","⒌","⒍","⒎","⒏","⒐","⒑","⒒","⒓","⒔","⒕","⒖","⒗","⒘","⒙","⒚","⒛"};
String add = "┼";
String black = "●";
String white = "○";
//初始化棋盘数据
for (int i = 0; i < goBang.length; i++) {
for (int j = 0; j < goBang[i].length; j++) {
if(j == len-1){//每一行的最后一列
goBang[i][j] = nums[i];
}else if(i == len-1){//最后一行
goBang[i][j] = nums[j];
}else{
goBang[i][j] = add;
}
}
}
//打印棋盘
for (String[] ss : goBang) {
for (String element : ss) {
System.out.print(element);
}
System.out.println();
}
Scanner scan = new Scanner(System.in);
boolean flag = true;//true-黑子 false-白子
boolean bool = true;
while(bool){
System.out.println("请" + ((flag)?"黑":"白") + "子输入坐标:");
int x = scan.nextInt() - 1;
int y = scan.nextInt() - 1;
//坐标是否超出棋盘范围
if(x<0 || x>len-2 || y<0 || y>len-2){
System.out.println("坐标超出棋盘范围,请重新输入");
continue;
}
//坐标上是否有棋子
if(!goBang[x][y].equals(add)){
System.out.println("坐标上已有棋子,请重新输入");
continue;
}
//落子
String pieces = (flag)?black:white;
goBang[x][y] = pieces;
//打印棋盘
for (String[] ss : goBang) {
for (String element : ss) {
System.out.print(element);
}
System.out.println();
}
//判断输赢 --- 这里暂时只判断左右连续为5颗棋子赢了,斜方向连续为5颗的情况这里未判断
int count = right(goBang, x, y, pieces) + left(goBang, x, y, pieces) + 1;
if(count>=5){
System.out.println(((flag)?"黑":"白") + "方赢");
bool = false;
}
//置反
flag = !flag;
}
}
//判断落子右边连续的棋子数
public static int right(String[][] goBang,int x,int y,String pieces){
int count = 0;
while(y<18){
y++;
if(goBang[x][y].equals(pieces)){
count++;
}else{
break;
}
}
return count;
}
//判断落子左边连续的棋子数
public static int left(String[][] goBang,int x,int y,String pieces){
int count = 0;
while(y>0){
y--;
if(goBang[x][y].equals(pieces)){
count++;
}else{
break;
}
}
return count;
}
}
五子棋,判断输赢
最新推荐文章于 2024-07-27 13:31:57 发布