package entity;

import java.util.ArrayList;
import java.util.HashSet;

/**
 * Created by amareelez on 23.12.16.
 */
@SuppressWarnings("JavaDoc") public class GameBoard {
    //int array to store the state of the board.
    //value at (x,y) cooresponds to:
    //-1 : occupied by our player
    //0  : Empty
    //1  : occupied by other player
    //2  : occupied by an arrow
    //The first array stores the row #, second array is the column #
    //The board is indexed starting at (0,0) at the TOP LEFT CORNER.
    //Incrementing the row, moves a player down.
    //Incrementing the column, moves a player right.
    public final int[][] board;

    public final int[][][] BFSQueenDistances = new int[8][10][10];
    public final int[][][] BFSKingDistances = new int[8][10][10];

    public final Amazon[] Amazons;  //An array of all the amazons on the board.

    //Indexes 0-3 store the positions of our amazon players.
    //Indexes 4-7 store the positions of the opponents players.
    public GameBoard(boolean firstPlayer) {
        board = new int[10][10];
        if (firstPlayer) {
            board[6][0] = -1;
            board[9][3] = -1;
            board[9][6] = -1;
            board[6][9] = -1;
            board[3][0] = 1;
            board[0][3] = 1;
            board[0][6] = 1;
            board[3][9] = 1;

            Amazons = new Amazon[8];
            Amazons[0] = new Amazon(6, 0, 0);
            Amazons[1] = new Amazon(9, 3, 1);
            Amazons[2] = new Amazon(9, 6, 2);
            Amazons[3] = new Amazon(6, 9, 3);
            Amazons[4] = new Amazon(3, 0, 4);
            Amazons[5] = new Amazon(0, 3, 5);
            Amazons[6] = new Amazon(0, 6, 6);
            Amazons[7] = new Amazon(3, 9, 7);

        } else {
            board[6][0] = 1;
            board[9][3] = 1;
            board[9][6] = 1;
            board[6][9] = 1;
            board[3][0] = -1;
            board[0][3] = -1;
            board[0][6] = -1;
            board[3][9] = -1;

            Amazons = new Amazon[8];
            Amazons[0] = new Amazon(3, 0, 0);
            Amazons[1] = new Amazon(0, 3, 1);
            Amazons[2] = new Amazon(0, 6, 2);
            Amazons[3] = new Amazon(3, 9, 3);
            Amazons[4] = new Amazon(6, 0, 4);
            Amazons[5] = new Amazon(9, 3, 5);
            Amazons[6] = new Amazon(9, 6, 6);
            Amazons[7] = new Amazon(6, 9, 7);
        }

    }

    public GameBoard(int[][] initialBoard, Amazon[] amazons) {
        this.board = initialBoard;
        this.Amazons = amazons;
    }

    public int getAmazonId(int x, int y) {
        int id = 0;
        for (entity.Amazon Amazon : Amazons) {
            if ((Amazon.row == x) && (Amazon.column == y)) {
                id = Amazon.id;
                break;
            }
        }

        return id;
    }

    public void moveOpponent(int id, int fromX, int fromY, int toX, int toY, boolean whitePlayer) {
        board[fromX][fromY] = 0;
        board[toX][toY] = 1;
        Amazons[id].updateCoords(toX, toY);
    }

    private void moveAmazon(int amazon, int row, int column) {
        board[Amazons[amazon].row][Amazons[amazon].column] = 0;
        board[row][column] = (amazon < 4) ? -1 : 1;
        Amazons[amazon].updateCoords(row, column);
    }

    private void fireArrow(int x, int y) {
        board[x][y] = 2;
    }

    public String toString() {
        String toReturn = "";
        for (int i = 0; i < 10; i++) {
            toReturn += "[";
            for (int j = 0; j < 10; j++) {
                toReturn += board[i][j];
                if (j != 9)
                    toReturn += "\t";
            }
            toReturn += "]\n";
        }
        return toReturn;
    }

    private GameBoard copyOf() {
        int[][] newBoard = new int[10][10];
        Amazon[] newAmazons = new Amazon[8];


        for (int i = 0; i < 10; i++) {
            System.arraycopy(this.board[i], 0, newBoard[i], 0, 10);
        }
        for (int i = 0; i < 8; i++) {
            newAmazons[i] =
                new Amazon(this.Amazons[i].row, this.Amazons[i].column, this.Amazons[i].id);
        }

        return new GameBoard(newBoard, newAmazons);
    }

    public HashSet<Integer> ourSpaces() {
        HashSet<Integer> spaces = new HashSet<>();
        for (int i = 0; i < 4; i++) {
            spaces.addAll(moveableSpaces(Amazons[i]));
        }

        return spaces;
    }

    public HashSet<Integer> theirSpaces() {
        HashSet<Integer> spaces = new HashSet<>();
        for (int i = 4; i < 8; i++) {
            spaces.addAll(moveableSpaces(Amazons[i]));
        }

        return spaces;
    }

    public ArrayList<Move.MoveAndBoard> getPossibleMoves(int amazonId) {
        ArrayList<Move.MoveAndBoard> successors = new ArrayList<>();
        //Moves Right
        for (int i = this.Amazons[amazonId].column + 1; i < 10; i++) {
            if (this.board[this.Amazons[amazonId].row][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, this.Amazons[amazonId].row, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove =
                        new Move(amazonId, this.Amazons[amazonId].row, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, this.Amazons[amazonId].row, i);
                }
            } else
                break;
        }

        //Moves Down
        for (int i = this.Amazons[amazonId].row + 1; i < 10; i++) {
            if (this.board[i][this.Amazons[amazonId].column] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, i, this.Amazons[amazonId].column);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove =
                        new Move(amazonId, i, this.Amazons[amazonId].column, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, i, this.Amazons[amazonId].column);
                }
            } else
                break;
        }

        //Moves Left
        for (int i = this.Amazons[amazonId].column - 1; i >= 0; i--) {
            if (this.board[this.Amazons[amazonId].row][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, this.Amazons[amazonId].row, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove =
                        new Move(amazonId, this.Amazons[amazonId].row, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, this.Amazons[amazonId].row, i);
                }
            } else
                break;
        }

        //Moves Up
        for (int i = this.Amazons[amazonId].row - 1; i >= 0; i--) {
            if (this.board[i][this.Amazons[amazonId].column] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, i, this.Amazons[amazonId].column);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove =
                        new Move(amazonId, i, this.Amazons[amazonId].column, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, i, this.Amazons[amazonId].column);
                }
            } else
                break;
        }

        //Moves Down-Right
        for (int i = this.Amazons[amazonId].column + 1, j = this.Amazons[amazonId].row + 1;
             i < 10 && j < 10; i++, j++) {
            if (this.board[j][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, j, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove = new Move(amazonId, j, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, j, i);
                }
            } else
                break;
        }

        //Moves Down-Left
        for (int i = this.Amazons[amazonId].column - 1, j = this.Amazons[amazonId].row + 1;
             i >= 0 && j < 10; i--, j++) {
            if (this.board[j][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, j, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove = new Move(amazonId, j, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, j, i);
                }
            } else
                break;
        }

        //Moves Up-Left
        for (int i = this.Amazons[amazonId].column - 1, j = this.Amazons[amazonId].row - 1;
             i >= 0 && j >= 0; i--, j--) {
            if (this.board[j][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, j, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove = new Move(amazonId, j, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, j, i);
                }
            } else
                break;
        }

        //Moves Up-Right
        for (int i = this.Amazons[amazonId].column + 1, j = this.Amazons[amazonId].row - 1;
             i < 10 && j >= 0; i++, j--) {
            if (this.board[j][i] == 0) {  //If the spot is empty
                GameBoard successor = this.copyOf();
                successor.moveAmazon(amazonId, j, i);
                ArrayList<int[]> arrows = successor.getPossibleArrows(amazonId);
                for (int[] arrow : arrows) {
                    successor.fireArrow(arrow[0], arrow[1]);
                    Move newMove = new Move(amazonId, j, i, arrow[0], arrow[1]);
                    successors.add(new Move.MoveAndBoard(successor, newMove));
                    successor = this.copyOf();
                    successor.moveAmazon(amazonId, j, i);
                }
            } else
                break;
        }

        return successors;
    }

    private ArrayList<int[]> getPossibleArrows(int amazonId) {
        ArrayList<int[]> arrows = new ArrayList<>();

        //Arrows Right
        for (int i = this.Amazons[amazonId].column + 1; i < 10; i++) {
            if (this.board[this.Amazons[amazonId].row][i] == 0) {
                arrows.add(new int[] {this.Amazons[amazonId].row, i});
            } else
                break;
        }

        //Arrows Down
        for (int i = this.Amazons[amazonId].row + 1; i < 10; i++) {
            if (this.board[i][this.Amazons[amazonId].column] == 0) {
                arrows.add(new int[] {i, this.Amazons[amazonId].column});
            } else
                break;
        }

        //Arrows Left
        for (int i = this.Amazons[amazonId].column - 1; i >= 0; i--) {
            if (this.board[this.Amazons[amazonId].row][i] == 0) {
                arrows.add(new int[] {this.Amazons[amazonId].row, i});
            } else
                break;
        }

        //Arrows Up
        for (int i = this.Amazons[amazonId].row - 1; i >= 0; i--) {
            if (this.board[i][this.Amazons[amazonId].column] == 0) {
                arrows.add(new int[] {i, this.Amazons[amazonId].column});
            } else
                break;
        }

        //Arrows Down-Right
        for (int i = this.Amazons[amazonId].column + 1, j = this.Amazons[amazonId].row + 1;
             i < 10 && j < 10; i++, j++) {
            if (this.board[j][i] == 0) {
                arrows.add(new int[] {j, i});
            } else
                break;
        }

        //Arrows Down-Left
        for (int i = this.Amazons[amazonId].column - 1, j = this.Amazons[amazonId].row + 1;
             i >= 0 && j < 10; i--, j++) {
            if (this.board[j][i] == 0) {
                arrows.add(new int[] {j, i});
            } else
                break;
        }

        //Arrows Up-Left
        for (int i = this.Amazons[amazonId].column - 1, j = this.Amazons[amazonId].row - 1;
             i >= 0 && j >= 0; i--, j--) {
            if (this.board[j][i] == 0) {
                arrows.add(new int[] {j, i});
            } else
                break;
        }

        //Arrows Up-Right
        for (int i = this.Amazons[amazonId].column + 1, j = this.Amazons[amazonId].row - 1;
             i < 10 && j >= 0; i++, j--) {
            if (this.board[j][i] == 0) {
                arrows.add(new int[] {j, i});
            } else
                break;
        }

        return arrows;
    }

    private HashSet<Integer> moveableSpaces(Amazon A) {
        HashSet<Integer> spaces = new HashSet<>();

        int column = A.column;
        int row = A.row;

        //Moves Right
        for (int i = column + 1; i < 10; i++) {
            if (board[row][i] == 0) {  //If the spot is empty
                spaces.add(row * 10 + i);
            } else
                break;
        }

        //Moves Down
        for (int i = row + 1; i < 10; i++) {
            if (board[i][column] == 0) {  //If the spot is empty
                spaces.add(i * 10 + column);
            } else
                break;
        }

        //Moves Left
        for (int i = column - 1; i >= 0; i--) {
            if (board[row][i] == 0) {  //If the spot is empty
                spaces.add(row * 10 + i);
            } else
                break;
        }

        //Moves Up
        for (int i = row - 1; i >= 0; i--) {
            if (board[i][column] == 0) {  //If the spot is empty
                spaces.add(i * 10 + column);
            } else
                break;
        }

        //Moves Down-Right
        for (int i = column + 1, j = row + 1; i < 10 && j < 10; i++, j++) {
            if (board[j][i] == 0) {  //If the spot is empty
                spaces.add(j * 10 + i);
            } else
                break;
        }

        //Moves Down-Left
        for (int i = column - 1, j = row + 1; i >= 0 && j < 10; i--, j++) {
            if (board[j][i] == 0) {  //If the spot is empty
                spaces.add(j * 10 + i);
            } else
                break;
        }

        //Moves Up-Left
        for (int i = column - 1, j = row - 1; i >= 0 && j >= 0; i--, j--) {
            if (board[j][i] == 0) {  //If the spot is empty
                spaces.add(j * 10 + i);
            } else
                break;
        }

        //Moves Up-Right
        for (int i = column + 1, j = row - 1; i < 10 && j >= 0; i++, j--) {
            if (board[j][i] == 0) {  //If the spot is empty
                spaces.add(j * 10 + i);
            } else
                break;
        }

        return spaces;
    }

    public int getOurFreedoms() {
        // get the freedom only of our amazons
        int sum = 0;
        for (int i = 0; i < 4; i++) {
            sum += getOurFreedom(Amazons[i]);
        }
        return sum;
    }

    /**
     * Count the number of empty spaces beside each amazon
     *
     * @param A
     * @return
     */
    public int getOurFreedom(Amazon A) {
        int sum = 0;
        try {
            if (board[A.row][A.column + 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row][A.column - 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row - 1][A.column - 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row + 1][A.column - 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row - 1][A.column + 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row + 1][A.column + 1] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row - 1][A.column] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        try {
            if (board[A.row + 1][A.column] == 0) {
                sum++;
            }
        } catch (Exception ignored) {

        }
        return sum;
    }

}