Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Minimax Java

    Uploaded by

    davids.boteron
    The document describes an implementation of a Tic-Tac-Toe game that uses the minimax algorithm for the computer player to select optimal moves. It defines Board and Move classes to represent the game state and a player's move. The minimax method recursively evaluates board positions to determine the best move for the maximizing player.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Minimax Java

    Uploaded by

    davids.boteron
    7 views4 pages
    The document describes an implementation of a Tic-Tac-Toe game that uses the minimax algorithm for the computer player to select optimal moves. It defines Board and Move classes to represent the game state and a player's move. The minimax method recursively evaluates board positions to determine the best move for the maximizing player.

    Original Title

    minimax.java

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an implementation of a Tic-Tac-Toe game that uses the minimax algorithm for the computer player to select optimal moves. It defines Board and Move classes to represent the game state and a player's move. The minimax method recursively evaluates board positions to determine the best move for the maximizing player.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    7 views4 pages

    Minimax Java

    Uploaded by

    davids.boteron
    The document describes an implementation of a Tic-Tac-Toe game that uses the minimax algorithm for the computer player to select optimal moves. It defines Board and Move classes to represent the game state and a player's move. The minimax method recursively evaluates board positions to determine the best move for the maximizing player.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 4

    import java.util.

    *;

    class Minimax {
    private static final int MAX_DEPTH = 5;

    static class Move {


    int row, col;

    Move(int row, int col) {


    this.row = row;
    this.col = col;
    }
    }

    static class Board {


    char[][] grid;

    Board() {
    grid = new char[][]{
    {'_', '_', '_'},
    {'_', '_', '_'},
    {'_', '_', '_'}
    };
    }

    boolean isMovesLeft() {
    for (int i = 0; i < 3; i++)
    for (int j = 0; j < 3; j++)
    if (grid[i][j] == '_')
    return true;
    return false;
    }

    int evaluate() {
    // Evaluación simple: suponemos que X es el jugador humano y O es la
    máquina
    // Si X gana, retorna -1, si O gana, retorna 1, si hay empate, retorna
    0
    for (int row = 0; row < 3; row++) {
    if (grid[row][0] == grid[row][1] && grid[row][1] == grid[row][2]) {
    if (grid[row][0] == 'X')
    return -1;
    else if (grid[row][0] == 'O')
    return 1;
    }
    }
    for (int col = 0; col < 3; col++) {
    if (grid[0][col] == grid[1][col] && grid[1][col] == grid[2][col]) {
    if (grid[0][col] == 'X')
    return -1;
    else if (grid[0][col] == 'O')
    return 1;
    }
    }
    if (grid[0][0] == grid[1][1] && grid[1][1] == grid[2][2]) {
    if (grid[0][0] == 'X')
    return -1;
    else if (grid[0][0] == 'O')
    return 1;
    }
    if (grid[0][2] == grid[1][1] && grid[1][1] == grid[2][0]) {
    if (grid[0][2] == 'X')
    return -1;
    else if (grid[0][2] == 'O')
    return 1;
    }
    return 0;
    }

    int minimax(int depth, boolean isMax) {


    int score = evaluate();

    if (score == 1)
    return score;
    if (score == -1)
    return score;
    if (!isMovesLeft())
    return 0;

    if (isMax) {
    int best = Integer.MIN_VALUE;
    for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
    if (grid[i][j] == '_') {
    grid[i][j] = 'O';
    best = Math.max(best, minimax(depth + 1, !isMax));
    grid[i][j] = '_';
    }
    }
    }
    return best;
    } else {
    int best = Integer.MAX_VALUE;
    for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
    if (grid[i][j] == '_') {
    grid[i][j] = 'X';
    best = Math.min(best, minimax(depth + 1, !isMax));
    grid[i][j] = '_';
    }
    }
    }
    return best;
    }
    }

    Move findBestMove() {
    int bestVal = Integer.MIN_VALUE;
    Move bestMove = new Move(-1, -1);

    for (int i = 0; i < 3; i++) {


    for (int j = 0; j < 3; j++) {
    if (grid[i][j] == '_') {
    grid[i][j] = 'O';
    int moveVal = minimax(0, false);
    grid[i][j] = '_';
    if (moveVal > bestVal) {
    bestMove.row = i;
    bestMove.col = j;
    bestVal = moveVal;
    }
    }
    }
    }

    return bestMove;
    }

    void printBoard() {
    for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
    System.out.print(grid[i][j] + " ");
    }
    System.out.println();
    }
    }
    }

    public static void main(String[] args) {


    Board board = new Board();
    board.printBoard();

    while (board.isMovesLeft()) {
    Move bestMove = board.findBestMove();
    System.out.println("La máquina juega en: " + bestMove.row + ", " +
    bestMove.col);
    board.grid[bestMove.row][bestMove.col] = 'O';
    board.printBoard();

    if (board.evaluate() == 1) {
    System.out.println("¡La máquina gana!");
    break;
    } else if (board.evaluate() == -1) {
    System.out.println("¡Has ganado!");
    break;
    } else if (!board.isMovesLeft()) {
    System.out.println("¡Empate!");
    break;
    }

    Scanner scanner = new Scanner(System.in);


    System.out.println("Tu turno. Ingresa fila (0-2): ");
    int row = scanner.nextInt();
    System.out.println("Ingresa columna (0-2): ");
    int col = scanner.nextInt();
    if (row < 0 || row > 2 || col < 0 || col > 2 || board.grid[row][col] !=
    '_') {
    System.out.println("Movimiento inválido, intenta de nuevo.");
    continue;
    }
    board.grid[row][col] = 'X';
    board.printBoard();

    if (board.evaluate() == 1) {
    System.out.println("¡La máquina gana!");
    break;
    } else if (board.evaluate() == -1) {
    System.out.println("¡Has ganado!");
    break;
    } else if (!board.isMovesLeft()) {
    System.out.println("¡Empate!");
    break;
    }
    }
    }
    }

    You might also like