#include <array>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <sys/types.h>
#include <vector>

#include "board/board.hpp"
#include "moves.hpp"

constexpr std::array<std::uint64_t, 64> computeKnightAttacks() {
  std::array<std::uint64_t, 64> attacks{};

  constexpr std::array<int, 8> knight_moves{-10, 6, 15, 17, 10, -6, -15, -17};

  for (int i = 0; i < 64; i++) {
    uint64_t bb = 0;
    for (int offset : knight_moves) {
      int next = i + offset;
      if (next >= 64 || next < 0) {
        continue;
      }
      const int fileDelta = (next % 8) - (i % 8);
      if (fileDelta != 1 && fileDelta != 2 && fileDelta != -1 &&
          fileDelta != -2) {
        continue;
      };
      bb |= 1ULL << next;
    }
    attacks[static_cast<size_t>(i)] = bb;
  }
  return attacks;
}

constexpr std::array<std::uint64_t, 64> KNIGHT_ATTACKS = computeKnightAttacks();

static void GenerateKnightMoves(Game *b, std::vector<Move> &moves,
                                bool GenerateQuietMoves) {
                                
  uint64_t knights = b->PieceBitboards[b->turn][KNIGHT];
  while (knights != 0) {
    int from = __builtin_ctzll(knights);
    knights &= knights - 1;
    uint64_t knight_attacks = KNIGHT_ATTACKS[static_cast<size_t>(from)];
    while (knight_attacks != 0) {
      int next = __builtin_ctzll(knight_attacks);
      knight_attacks &= knight_attacks - 1;

      bool hasFriendlyPiece =
          b->turn ? (b->WhitePieceBitboard & (1ULL << next)) > 0
                  : (b->BlackPieceBitboard & (1ULL << next)) > 0;

      bool isCaptuare = (b->PieceBitboard & (1ULL << next)) > 0;
      if (hasFriendlyPiece) {
        continue;
      }
      if (!GenerateQuietMoves && !isCaptuare) {
        continue;
      }
      moves.push_back(
          {.From = IndexToPosition(from), .To = IndexToPosition(next)});
    }
  }
};

void GeneratePawnMoves(Game *b, int from, std::vector<Move> &moves,
                       bool quietMoves) {
  Piece pawn = b->pieces[from];
  if (pawn.type != PAWN) {
    assert(false && "Calling generate pawn moves on non pawn");
    return;
  }
  Position position = IndexToPosition(from);
  int step = (pawn.color ? 1 : -1) * 8;
  int next = from + step;

  // wrap check
  if (position.rank + (pawn.color ? 1 : -1) < 0 ||
      position.rank + (pawn.color ? 1 : -1) >= 8) {
    return;
  }

  // if piece it want to move to is none and it as legal move
  if (quietMoves) {
    if (b->pieces[next].type == NONEPIECE) {
      if (position.rank + (pawn.color ? 1 : -1) == 0 ||
          position.rank + (pawn.color ? 1 : -1) == 7) {
        moves.push_back({position, IndexToPosition(next), QUEEN});
        moves.push_back({position, IndexToPosition(next), ROOK});
        moves.push_back({position, IndexToPosition(next), BISHOP});
        moves.push_back({position, IndexToPosition(next), KNIGHT});
      } else {
        moves.push_back({position, IndexToPosition(next)});
      }

      int startingRank = pawn.color ? 1 : 6;
      int twoSteps = from + step * 2;
      if (position.rank == startingRank &&
          b->pieces[twoSteps].type == NONEPIECE) {
        moves.push_back({position, IndexToPosition(twoSteps)});
      }
    }
  };

  for (int fileOffset : {-1, 1}) {
    int targetFile = position.file + fileOffset;
    int targetRank = position.rank + (pawn.color ? 1 : -1);

    if (targetFile < 0 || targetFile >= 8)
      continue;

    if (targetRank < 0 || targetRank >= 8)
      continue;

    int target = targetRank * 8 + targetFile;

    if (IndexToPosition(target) == b->enPassant && b->canEnpassant) {
      moves.push_back({position, IndexToPosition(target)});
    }

    if (b->pieces[target].type != NONEPIECE &&
        b->pieces[target].color != pawn.color) {
      if (targetRank == 0 || targetRank == 7) {
        moves.push_back({position, IndexToPosition(target), QUEEN});
        moves.push_back({position, IndexToPosition(target), ROOK});
        moves.push_back({position, IndexToPosition(target), BISHOP});
        moves.push_back({position, IndexToPosition(target), KNIGHT});
      } else {
        moves.push_back({position, IndexToPosition(target)});
      }
    }
  }
  // the end
};
void GenerateKingMoves(Game *b, int from, std::vector<Move> &moves,
                       bool GenerateQuietMoves) {
  if (b->pieces[from].type != KING) {
    assert(false && "calling generate king moves on non king");
    return;
  }
  if (b->pieces[from].color != b->turn) {
    assert(false && "calling generate king moves on king of opposite color");
    return;
  }
  constexpr std::array<int, 8> king_moves{-1, 1, 8, -8, -9, 9, -7, 7};
  for (int offset : king_moves) {
    int next = from + offset;
    if (next >= 64 || next < 0) {
      continue;
    }
    if (std::abs((next % 8) - (from % 8)) > 1) {
      continue;
    };
    if (b->pieces[next].type != NONEPIECE) {
      if (b->pieces[next].color == b->turn) {
        continue;
      };
    }
    if (!GenerateQuietMoves && b->pieces[next].type == NONEPIECE) {
      continue;
    }

    moves.push_back({IndexToPosition(from), IndexToPosition(next)});
  }
};

std::vector<Move> GetPseudoLegalMoves(Game *b, bool GenerateQuietMoves) {
  std::vector<Move> moves;
  moves.reserve(40);

  GenerateKnightMoves(b, moves, GenerateQuietMoves);

  constexpr std::array<int, 4> rook_Moves{-1, 1, 8, -8};
  constexpr std::array<int, 4> bishop_Moves{-9, 9, -7, 7};

  uint64_t piece_bitboard = b->PieceBitboard;
  while (piece_bitboard != 0) {
    int i = __builtin_ctzll(piece_bitboard);
    piece_bitboard &= piece_bitboard - 1;
    Piece piece = b->pieces[i];
    if (piece.type == NONEPIECE) {
      assert(false && "got none piece in piece bitboard");
    }
    if (piece.color != b->turn) {
      continue;
    }

    if (piece.type == PAWN) {
      GeneratePawnMoves(b, i, moves, GenerateQuietMoves);
    }
    if (piece.type == BISHOP) {
      GenerateSlidingMoves(b, i, bishop_Moves, moves, GenerateQuietMoves);
    }
    if (piece.type == ROOK) {
      GenerateSlidingMoves(b, i, rook_Moves, moves, GenerateQuietMoves);
    }
    if (piece.type == QUEEN) {
      GenerateSlidingMoves(b, i, rook_Moves, moves, GenerateQuietMoves);
      GenerateSlidingMoves(b, i, bishop_Moves, moves, GenerateQuietMoves);
    }
    if (piece.type == KING) {
      GenerateKingMoves(b, i, moves, GenerateQuietMoves);
      if (GenerateQuietMoves) {
        GenerateCastlingMoves(i, b, moves);
      }
    };
  };

  return moves;
}
bool IsSquareAttacked(Game *g, Position square, bool byColor) {
  int target = PositionToIndex(square);

  // Pawn attacks: a pawn of byColor attacks diagonally "forward" from its
  // own perspective. White pawns (rank increases toward rank 7) attack from
  // one rank below the target; Black pawns attack from one rank above.
  int pawnRank = square.rank + (byColor ? -1 : 1);

  if (pawnRank >= 0 && pawnRank < 8) {
    for (int fileOffset : {-1, 1}) {
      int file = square.file + fileOffset;
      if (file < 0 || file >= 8)
        continue;

      Piece p = g->pieces[pawnRank * 8 + file];
      if (p.type == PAWN && p.color == byColor)
        return true;
    }
  }

  // Knight attacks
  constexpr std::array<int, 8> knightOffsets{-17, -15, -10, -6, 6, 10, 15, 17};
  for (int offset : knightOffsets) {
    int from = target + offset;
    if (from < 0 || from >= 64)
      continue;

    int fileDiff = std::abs((from % 8) - (target % 8));
    if (fileDiff != 1 && fileDiff != 2)
      continue;

    Piece p = g->pieces[from];
    if (p.type == KNIGHT && p.color == byColor)
      return true;
  }

  // King attacks
  constexpr std::array<int, 8> kingOffsets{-9, -8, -7, -1, 1, 7, 8, 9};
  for (int offset : kingOffsets) {
    int from = target + offset;
    if (from < 0 || from >= 64)
      continue;
    if (std::abs((from % 8) - (target % 8)) > 1)
      continue;

    Piece p = g->pieces[from];
    if (p.type == KING && p.color == byColor)
      return true;
  }

  // Rooks + queens (orthogonal rays)
  constexpr std::array<int, 4> rookDirs{-8, 8, -1, 1};
  for (int dir : rookDirs) {
    int pos = target;
    while (true) {
      int next = pos + dir;
      if (next < 0 || next >= 64)
        break;
      if ((dir == 1 || dir == -1) && next / 8 != pos / 8)
        break; // horizontal wrap

      Piece p = g->pieces[next];
      if (p.type != NONEPIECE) {
        if (p.color == byColor && (p.type == ROOK || p.type == QUEEN))
          return true;
        break;
      }
      pos = next;
    }
  }

  // Bishops + queens (diagonal rays)
  constexpr std::array<int, 4> bishopDirs{-9, 9, -7, 7};
  for (int dir : bishopDirs) {
    int pos = target;
    while (true) {
      int next = pos + dir;
      if (next < 0 || next >= 64)
        break;
      if (std::abs((next % 8) - (pos % 8)) != 1)
        break; // diagonal wrap

      Piece p = g->pieces[next];
      if (p.type != NONEPIECE) {
        if (p.color == byColor && (p.type == BISHOP || p.type == QUEEN))
          return true;
        break;
      }
      pos = next;
    }
  }

  return false;
}
std::vector<Move> GetLegalMoves(Game *g, bool quietMove) {
  std::vector<Move> moves = GetPseudoLegalMoves(g, quietMove);
  std::vector<Move> legalMoves;
  legalMoves.reserve(moves.size());

  for (const Move &move : moves) {
    UndoMove undo = MakeMove(move, g);

    bool legal = true;

    Position kingPosition = FindKing(g, !g->turn);

    // opponent attacks our king?
    if (IsSquareAttacked(g, kingPosition, g->turn)) {
      legal = false;
    }

    UnMakeMove(undo, g);

    if (legal) {
      legalMoves.push_back(move);
    }
  }

  return legalMoves;
}
GameState GetNewGameState(Game *g) {
  // make sure we dont override game ending states
  if (g->state == DRAW || g->state == WHITE_WON || g->state == BLACK_WON) {
    return g->state;
  }
  if (g->halfMoveClock >= 100) {
    g->state = DRAW;
  }

  auto legalMoves = GetLegalMoves(g);

  if (legalMoves.empty()) {
    Position kingPosition = FindKing(g, g->turn);

    bool check = IsSquareAttacked(g, kingPosition, !g->turn);

    if (check) {
      g->state = g->turn ? BLACK_WON : WHITE_WON;
    } else {
      g->state = DRAW;
    }
  }
  return g->state;
}

Position IndexToPosition(int i) {
  uint8_t rank = static_cast<uint8_t>(i / 8); // 0-7
  uint8_t file = static_cast<uint8_t>(i % 8); // 0-7
  return {rank, file};
}

void GenerateSlidingMoves(Game *b, int from,
                          const std::array<int, 4> &directions,
                          std::vector<Move> &moves, bool GenerateQuietMoves) {
  for (uint i = 0; i < directions.size(); i++) {
    int direction = directions[i];

    int i2 = from;
    while (true) {
      i2 += direction;
      int oldFile = (i2 - direction) % 8;
      int newFile = i2 % 8;

      if (direction == 7 || direction == -7 || direction == 9 ||
          direction == -9) {
        if (std::abs(newFile - oldFile) != 1)
          break;
      }
      if (i2 >= 64 || i2 < 0) {
        break;
      }

      if ((direction == 1 || direction == -1) &&
          (i2 / 8 != (i2 - direction) / 8)) {
        break;
      }
      if (b->pieces[i2].color == b->turn && b->pieces[i2].type != NONEPIECE) {
        break;
      }
      if (!GenerateQuietMoves && b->pieces[i2].type == NONEPIECE) {
        continue;
      }
      moves.push_back({IndexToPosition(from), IndexToPosition(i2)});
      if (b->pieces[i2].color != b->turn && b->pieces[i2].type != NONEPIECE) {
        break;
      }
    }
  };
};
void GenerateCastlingMoves(int from, Game *g, std::vector<Move> &moves) {
  Piece piece = g->pieces[from];
  if (piece.type != KING) {
    assert(false && "Calling generate castling moves on non king piece");
    std::cout << "Internal error\n";
    exit(1);
  }
  if (from != 60 && !g->turn) {
    return;
  }
  if (from != 4 && g->turn) {
    return;
  }
  bool oneToRight = g->PieceBitboard & (1ULL << (from + 1));
  bool twoToRight = g->PieceBitboard & (1ULL << (from + 2));
  bool oneToLeft = g->PieceBitboard & (1ULL << (from - 1));
  bool twoToLeft = g->PieceBitboard & (1ULL << (from - 2));
  bool threeToLeft = g->PieceBitboard & (1ULL << (from - 3));

  Position kingPosition = FindKing(g, g->turn);

  bool check = IsSquareAttacked(g, kingPosition, !g->turn);
  if (check) {
    return;
  }
  auto pathIsSafe = [&](int step) {
    return !IsSquareAttacked(g, IndexToPosition(from + step), !g->turn) &&
           !IsSquareAttacked(g, IndexToPosition(from + 2 * step), !g->turn);
  };
  if (g->turn) {
    // white
    if (!oneToRight && !twoToRight && g->whiteCastleKing) {
      if (pathIsSafe(1)) {
        moves.push_back(
            {.From = IndexToPosition(from), .To = IndexToPosition(from + 2)});
      }
    }
    if (!oneToLeft && !twoToLeft && !threeToLeft && g->whiteCastleQueen) {
      if (pathIsSafe(-1)) {
        moves.push_back(
            {.From = IndexToPosition(from), .To = IndexToPosition(from - 2)});
      }
    }
  }
  if (!g->turn) {
    // black
    if (!oneToRight && !twoToRight && g->blackCastleKing) {
      if (pathIsSafe(1)) {
        moves.push_back(
            {.From = IndexToPosition(from), .To = IndexToPosition(from + 2)});
      }
    }
    if (!oneToLeft && !twoToLeft && !threeToLeft && g->blackCastleQueen) {
      if (pathIsSafe(-1)) {
        moves.push_back(
            {.From = IndexToPosition(from), .To = IndexToPosition(from - 2)});
      }
    }
  }
}