SearchHeuristics.h

Go to the documentation of this file.

#pragma once

 
#include <array>
#include <cstdint>
#include "ISearch.h"

struct SearchHeuristics {
  std::array<std::array<Move, 2>, SearchConstants::MAX_PLY> killers_{}; 
  std::array<std::array<int, 64>, 64> history_{};                       
  std::array<std::array<Move, 64>, 64> countermove_{};                  
  std::array<std::array<std::array<std::array<int, 64>, 16>, 64>, 16> contHist_{}; 
  std::array<std::array<int, 64>, 16> captureHist_{};                   
  
  std::array<std::array<int16_t, 16384>, 2> pawnCorrHist_{};            
  std::array<std::array<std::array<int16_t, 16384>, 2>, 2> nonPawnCorrHist_{}; 
  std::array<std::array<std::array<std::array<int16_t, 64>, 16>, 64>, 16> contCorrHist_{}; 
 
  std::array<std::array<Move, SearchConstants::MAX_PLY>, SearchConstants::MAX_PLY> pvTable_{}; 
  std::array<int, SearchConstants::MAX_PLY> failHighCount_{};           
 
  // Pre-allocated move generation buffers per ply to avoid vector allocations
  std::array<std::array<Move, 256>, SearchConstants::MAX_PLY> captures_{};      
  std::array<std::array<int, 256>, SearchConstants::MAX_PLY> captureScores_{};  
  std::array<std::array<Move, 256>, SearchConstants::MAX_PLY> quiets_{};        
  std::array<std::array<int, 256>, SearchConstants::MAX_PLY> quietScores_{};    
  std::array<std::array<Move, 256>, SearchConstants::MAX_PLY> badCaptures_{};   
  std::array<std::array<Move, 256>, SearchConstants::MAX_PLY> searchedQuiets_{}; 
};