new pr because fixing merge conflict would take too long

1 files changed, 0 insertions, 104 deletions

diff --git a/src/main/java/me/xmrvizzy/skyblocker/utils/tictactoe/TicTacToeUtils.java b/src/main/java/me/xmrvizzy/skyblocker/utils/tictactoe/TicTacToeUtils.java
deleted file mode 100644
index 5e5c8f89..00000000
--- a/src/main/java/me/xmrvizzy/skyblocker/utils/tictactoe/TicTacToeUtils.java
+++ /dev/null
@@ -1,104 +0,0 @@
-package me.xmrvizzy.skyblocker.utils.tictactoe;
-
-import java.util.Collections;
-import java.util.HashMap;
-import java.util.Map;
-
-public class TicTacToeUtils {
-
-    public static int getBestMove(char[][] board) {
-        HashMap<Integer, Integer> moves = new HashMap<>();
-        for (int row = 0; row < board.length; row++) {
-            for (int col = 0; col < board[row].length; col++) {
-                if (board[row][col] != '\0') continue;
-                board[row][col] = 'O';
-                int score = alphabeta(board, Integer.MIN_VALUE, Integer.MAX_VALUE, false, 0);
-                board[row][col] = '\0';
-                moves.put(row * 3 + col + 1, score);
-            }
-        }
-        return Collections.max(moves.entrySet(), Map.Entry.comparingByValue()).getKey();
-    }
-
-    public static boolean hasMovesLeft(char[][] board) {
-        for (char[] rows : board) {
-            for (char col : rows) {
-                if (col == '\0') return true;
-            }
-        }
-        return false;
-    }
-
-    public static int getBoardRanking(char[][] board) {
-        for (int row = 0; row < 3; row++) {
-            if (board[row][0] == board[row][1] && board[row][0] == board[row][2]) {
-                if (board[row][0] == 'X') {
-                    return -10;
-                } else if (board[row][0] == 'O') {
-                    return 10;
-                }
-            }
-        }
-
-        for (int col = 0; col < 3; col++) {
-            if (board[0][col] == board[1][col] && board[0][col] == board[2][col]) {
-                if (board[0][col] == 'X') {
-                    return -10;
-                } else if (board[0][col] == 'O') {
-                    return 10;
-                }
-            }
-        }
-
-        if (board[0][0] == board[1][1] && board[0][0] == board[2][2]) {
-            if (board[0][0] == 'X') {
-                return -10;
-            } else if (board[0][0] == 'O') {
-                return 10;
-            }
-        } else if (board[0][2] == board[1][1] && board[0][2] == board[2][0]) {
-            if (board[0][2] == 'X') {
-                return -10;
-            } else if (board[0][2] == 'O') {
-                return 10;
-            }
-        }
-
-        return 0;
-    }
-    public static int alphabeta(char[][] board, int alpha, int beta, boolean max, int depth) {
-        int score = getBoardRanking(board);
-        if (score == 10 || score == -10) return score;
-        if (!hasMovesLeft(board)) return 0;
-
-        if (max) {
-            int bestScore = Integer.MIN_VALUE;
-            for (int row = 0; row < 3; row++) {
-                for (int col = 0; col < 3; col++) {
-                    if (board[row][col] == '\0') {
-                        board[row][col] = 'O';
-                        bestScore = Math.max(bestScore, alphabeta(board, alpha, beta, false, depth + 1));
-                        board[row][col] = '\0';
-                        alpha = Math.max(alpha, bestScore);
-                        if (beta <= alpha) break; // Pruning
-                    }
-                }
-            }
-            return bestScore - depth;
-        } else {
-            int bestScore = Integer.MAX_VALUE;
-            for (int row = 0; row < 3; row++) {
-                for (int col = 0; col < 3; col++) {
-                    if (board[row][col] == '\0') {
-                        board[row][col] = 'X';
-                        bestScore = Math.min(bestScore, alphabeta(board, alpha, beta, true, depth + 1));
-                        board[row][col] = '\0';
-                        beta = Math.min(beta, bestScore);
-                        if (beta <= alpha) break; // Pruning
-                    }
-                }
-            }
-            return bestScore + depth;
-        }
-    }
-}
\ No newline at end of file