• 井字游戏 人机对战 java实现


    package com.ecnu.Main;

    /**
    * 主函数触发游戏
    */
    public class MainApplication {
    public static void main(String[] args){
    TicTacToeGame ticTacToeGame = new TicTacToeGame();
    ticTacToeGame.start();
    }
    }

    //TicTacToeGame 方法类

    import java.util.Scanner;

    public class TicTacToeGame {

    private int stepCount = 0;
    private int[][] gameBoard;
    private Scanner scanner = new Scanner(System.in);
    private final int humanFlag = 1;
    private final int computerFlag = -1;
    private final int emptyFlag = 0;

    public void start() {
    initGameBoard();
    System.out.println("Game Board is ready!!! Game start!!!");
    computerThink();

    }

    private void initGameBoard() {
    this.gameBoard = new int[3][3];
    for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
    gameBoard[i][j] = emptyFlag;
    }
    }

    showGameBoard();

    }

    private void computerThink() {
    System.out.println("Computer:");
    Move move = calculateTheBestMove();
    int x = move.getX();
    int y = move.getY();
    gameBoard[y][x] = computerFlag;
    stepCount++;
    showGameBoard();

    if(!isGameOver(x, y)){
    humanAction();
    }
    }

    private Move calculateTheBestMove(){
    Move move = new Move();
    Integer bestWeight = null;
    Integer bestX = null;
    Integer bestY = null;


    for(int y=0; y<3; y++){
    for(int x=0; x<3; x++){
    if(gameBoard[y][x] == 0){
    gameBoard[y][x] = computerFlag;
    stepCount ++;
    if(isWin(x,y)){
    stepCount --;
    move.setX(x);
    move.setY(y);
    move.setWeight(1000);
    gameBoard[y][x] = emptyFlag;

    return move;
    }else if(isTie()){
    stepCount --;
    move.setX(x);
    move.setY(y);
    move.setWeight(0);
    gameBoard[y][x] = emptyFlag;

    return move;
    }else{
    Move worstMove = calculateTheWorstMove();
    stepCount --;
    gameBoard[y][x] = emptyFlag;
    if(bestWeight == null || worstMove.getWeight()>= bestWeight){
    bestX = x;
    bestY = y;
    bestWeight =worstMove.getWeight();
    }
    }

    }
    }
    }

    move.setWeight(bestWeight);
    move.setX(bestX);
    move.setY(bestY);
    return move;
    }

    private Move calculateTheWorstMove(){
    Move move = new Move();
    Integer bestWeight = null;
    Integer bestX = null;
    Integer bestY = null;

    for(int y=0; y<3; y++){
    for(int x=0; x<3; x++){
    if(gameBoard[y][x] == 0){
    gameBoard[y][x] = humanFlag;
    stepCount ++;
    if(isWin(x,y)){
    stepCount --;
    move.setX(x);
    move.setY(y);
    move.setWeight(-1000);
    gameBoard[y][x] = emptyFlag;
    return move;
    }else if(isTie()){
    stepCount --;
    move.setX(x);
    move.setY(y);
    move.setWeight(0);
    gameBoard[y][x] = emptyFlag;
    return move;
    }else{
    Move bestMove = calculateTheBestMove();
    stepCount --;
    gameBoard[y][x] = emptyFlag;
    if(bestX == null || bestMove.getWeight() < bestWeight){
    bestX = x;
    bestY = y;
    bestWeight = bestMove.getWeight();
    }
    }


    }
    }
    }

    move.setWeight(bestWeight);
    move.setX(bestX);
    move.setY(bestY);

    return move;
    }

    private void humanAction() {
    System.out.println("It is your turn now!");

    boolean isHumanTurn = true;
    int x = 0;
    int y = 0;
    while(isHumanTurn){
    System.out.println("Please input the row number (1~3):");
    y = scanner.nextInt() - 1;
    System.out.println("Please input the column number (1~3):");
    x = scanner.nextInt() - 1;

    if (isInputValid(x, y)){
    isHumanTurn = false;
    gameBoard[y][x] = humanFlag;

    }else{
    System.out.println(String.format("You cannot place on row %d, column %d", y + 1, x + 1));
    }

    }
    stepCount++;
    showGameBoard();

    if(!isGameOver(x, y)){

    computerThink();
    }

    }


    private boolean isWin(int x, int y) {

    return (Math.abs(gameBoard[y][0] + gameBoard[y][1] + gameBoard[y][2]) == 3) ||
    (Math.abs(gameBoard[0][x] + gameBoard[1][x] + gameBoard[2][x]) == 3) ||
    (Math.abs(gameBoard[0][0] + gameBoard[1][1] + gameBoard[2][2]) == 3) ||
    (Math.abs(gameBoard[2][0] + gameBoard[1][1] + gameBoard[0][2]) == 3);
    }

    private boolean isTie() {
    return stepCount >= 9;
    }

    private boolean isInputValid(int x, int y){
    return x>=0 && x<3 && y>=0 && y<3 && gameBoard[y][x] == 0;
    }

    private boolean isGameOver(int x, int y){
    boolean isGameOver = true;
    if(isWin(x, y)){
    if(gameBoard[y][x] == -1){
    System.out.println("Computer Win!!!!");

    }else{
    System.out.println("You Win!!!!");
    }
    }else if(isTie()){
    System.out.println("Tie!!!");
    }else{
    isGameOver = false;
    }

    return isGameOver;
    }


    private void showGameBoard(){
    for(int y=0; y<3; y++){
    for(int x=0; x<3; x++){
    if(gameBoard[y][x] == -1){
    System.out.print("2 ");
    }else {
    System.out.print(gameBoard[y][x] + " ");
    }
    }
    System.out.println();
    }

    System.out.println();

    }

    }

    class Move{
    private int x;
    private int y;
    private int weight;

    public int getX() {
    return x;
    }

    public void setX(int x) {
    this.x = x;
    }

    public int getY() {
    return y;
    }

    public void setY(int y) {
    this.y = y;
    }

    public int getWeight() {
    return weight;
    }

    public void setWeight(int weight) {
    this.weight = weight;
    }
    }

  • 相关阅读:
    物联网架构成长之路(11)-Redis缓存主从复制
    物联网架构成长之路(10)-Nginx负载均衡
    物联网架构成长之路(9)-双机热备Keepalived了解
    物联网架构成长之路(8)-EMQ-Hook了解、连接Kafka发送消息
    2017年年度总结
    物联网架构成长之路(7)-EMQ权限验证小结
    物联网架构成长之路(6)-EMQ权限控制
    物联网架构成长之路(5)-EMQ插件配置
    物联网架构成长之路(4)-EMQ插件创建
    物联网架构成长之路(3)-EMQ消息服务器了解
  • 原文地址:https://www.cnblogs.com/cdlyy/p/10199120.html
Copyright © 2020-2023  润新知