Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::AdversarialSearchKeyer Concept Reference

Concept for explicit state-key providers used by adversarial TT overloads. More...

#include <Negamax.H>

Concept definition

template<typename Table, typename Keyer, typename State, typename Move, typename Score>
concept Aleph::AdversarialSearchKeyer = SearchState<State> and SearchMove<Move> and AdversarialScore<Score>
and (not AdversarialSearchTracer<Keyer, Move, Score>) and requires(Keyer &keyer, const State &state) {
typename std::invoke_result_t<Keyer &, const State &>;
requires AdversarialTranspositionMemo<Table, std::invoke_result_t<Keyer &, const State &>, Move, Score>;
}
Aleph::AdversarialScore
Score type accepted by adversarial search engines.
Definition Negamax.H:70
Aleph::AdversarialSearchKeyer
Concept for explicit state-key providers used by adversarial TT overloads.
Definition Negamax.H:254
Aleph::AdversarialSearchTracer
Concept for adversarial-search trace sinks.
Definition Negamax.H:246
Aleph::AdversarialTranspositionMemo
Concept for memo tables storing adversarial-search entries.
Definition Negamax.H:156
Aleph::SearchMove
Minimal requirement for search moves.
Definition state_search_common.H:96
Aleph::SearchState
Minimal requirement for mutable search states.
Definition state_search_common.H:88
Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2594
Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Detailed Description

Concept for explicit state-key providers used by adversarial TT overloads.

Definition at line 253 of file Negamax.H.