KillerMoves.hpp

Go to the documentation of this file.

/*
 * ======================================================================================
 *
 * ░▒▓███████▓▒░░▒▓████████▓▒░▒▓███████▓▒░       ░▒▓███████▓▒░ ░▒▓██████▓▒░▒▓████████▓▒░
 * ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░░▒▓█▓▒░ ░▒▓█▓▒░
 * ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░░▒▓█▓▒░ ░▒▓█▓▒░
 * ░▒▓███████▓▒░░▒▓██████▓▒░ ░▒▓█▓▒░░▒▓█▓▒░      ░▒▓███████▓▒░░▒▓█▓▒░░▒▓█▓▒░ ░▒▓█▓▒░
 * ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░░▒▓█▓▒░ ░▒▓█▓▒░
 * ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░      ░▒▓█▓▒░░▒▓█▓▒░▒▓█▓▒░░▒▓█▓▒░ ░▒▓█▓▒░
 * ░▒▓███████▓▒░░▒▓████████▓▒░▒▓█▓▒░░▒▓█▓▒░      ░▒▓███████▓▒░ ░▒▓██████▓▒░  ░▒▓█▓▒░
 *
 * ======================================================================================
 */

 
#pragma once
 
#include <algorithm>
#include <array>
#include <cassert>
#include <cstddef> // IWYU pragma: keep - for size_t
#include <libbenbot/search/Constants.hpp>
#include <libchess/moves/Move.hpp>
#include <libchess/moves/MoveGen.hpp>
#include <span>
#include <vector>
 
namespace ben_bot {
 
using chess::moves::Move;
using std::size_t;

struct KillerMoves final {
    void clear()
    {
        for (auto& list : lists)
            list.clear();
    }

    void store(const size_t plyFromRoot, const Move move)
    {
        assert(plyFromRoot < search::MAX_PLY);
 
        auto& list = lists.at(plyFromRoot);
 
        if (not std::ranges::contains(list, move))
            list.emplace_back(move);
    }

    [[nodiscard]] auto get(const size_t plyFromRoot) const noexcept -> std::span<const Move>
    {
        return lists.at(plyFromRoot);
    }
 
private:
    using Killers = std::vector<Move>;
 
    std::array<Killers, search::MAX_PLY + 1uz> lists { };
};
 
} // namespace ben_bot