Aleph::Prefer_Exact_Adversarial_Entry< Move, Score > Struct Template Reference

Replacement policy for adversarial transposition entries. More...

#include <Negamax.H>

Public Types
using	Entry = AdversarialTranspositionEntry< Move, Score >

Public Member Functions
bool	operator() (const Entry &candidate, const Entry &current) const noexcept

Detailed Description

template<SearchMove Move, AdversarialScore Score>
struct Aleph::Prefer_Exact_Adversarial_Entry< Move, Score >

Replacement policy for adversarial transposition entries.

Entries are keyed by (state_key, remaining_depth), so depth mismatches are already separated at the key level. Replacement therefore only needs to prefer stronger information for the same keyed search configuration:

• exact values replace lower/upper bounds,
• otherwise the existing entry is kept.

Definition at line 103 of file Negamax.H.

Member Typedef Documentation

Entry

template<SearchMove Move, AdversarialScore Score>

using Aleph::Prefer_Exact_Adversarial_Entry< Move, Score >::Entry = AdversarialTranspositionEntry<Move, Score>

Definition at line 105 of file Negamax.H.

Member Function Documentation

operator()()

template<SearchMove Move, AdversarialScore Score>

bool Aleph::Prefer_Exact_Adversarial_Entry< Move, Score >::operator() ( const Entry &  candidate, const Entry &  current  ) const

inlinenoexcept

Definition at line 107 of file Negamax.H.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::Exact.

---

The documentation for this struct was generated from the following file:

• Negamax.H