#pragma once

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

#include <atomic>
#include <chrono>

namespace ai {
    class AI {
      protected:
        bool am_white;
        std::chrono::milliseconds thinking_time;
        virtual Move _search(const Board&) = 0;

      public:
        AI(bool am_white, std::chrono::milliseconds tt)
            : am_white(am_white),
              thinking_time(tt) {}

        std::atomic<bool> stop_computation = false;

        Move search(const Board& b);
        int eval(const Board&);

        virtual int _eval(const Board&) = 0;
    };

    struct v0_random : public AI {
        v0_random(bool w, std::chrono::milliseconds tt): AI(w, tt) {}

        Move _search(const Board&) override;

        int _eval(const Board&) override {
            return 0;
        };
    };

    class v1_pure_minimax : public AI { // looks two moves ahead
        int _search(const Board&, int);

      public:
        v1_pure_minimax(bool w, std::chrono::milliseconds tt): AI(w, tt) {}

        Move _search(const Board&) override;
        int _eval(const Board&) override;
    };

    class v2_alpha_beta : public AI {
        // looks two moves ahead, with alpha-beta pruning (no move ordering)
        virtual int _search(const Board&, int, int, int);

      public:
        v2_alpha_beta(bool w, std::chrono::milliseconds tt): AI(w, tt) {}

        virtual Move _search(const Board&) override;
        virtual int _eval(const Board&) override;
    };

    class v3_AB_ordering : public AI {
        // looks two moves ahead, with alpha-beta pruning, with move ordering
        virtual int _ab_search(const Board&, int, int, int);

      public:
        v3_AB_ordering(bool w, std::chrono::milliseconds tt): AI(w, tt) {}

        virtual Move _search(const Board&) override;
        virtual int _eval(const Board&) override;
    };

    class v4_search_captures : public v3_AB_ordering {
      protected:
        // same as v3, but looking at only at captures when leaf is reached,
        // until no captures are left
        virtual int _ab_search(const Board&, int, int, int) override;
        virtual int _search_captures(const Board&, int, int);

      public:
        v4_search_captures(bool w, std::chrono::milliseconds tt)
            : v3_AB_ordering(w, tt) {}
    };

    class v5_better_endgame : public v4_search_captures {
        // same as v4, but with a better evaluation function, that forces the
        // king towards the corner of the board for endgames

      public:
        v5_better_endgame(bool w, std::chrono::milliseconds tt)
            : v4_search_captures(w, tt) {}

        virtual int _eval(const Board&) override;
    };

    class v6_iterative_deepening : public v5_better_endgame {
        // same as v5, but instead of just looking 2 moves ahead, it does
        // iterative depening until and keeps on searching until the thinking
        // time runs out

      public:
        v6_iterative_deepening(bool w, std::chrono::milliseconds tt)
            : v5_better_endgame(w, tt) {}

        virtual Move _search(const Board&) override;
    };
} // namespace ai