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

Concept for adversarial-search trace sinks. More...

#include <Negamax.H>

Concept definition

template<typename Tracer, typename Move, typename Score>
{ tracer(event) } -> std::same_as<void>;
}
Score type accepted by adversarial search engines.
Definition Negamax.H:70
Concept for adversarial-search trace sinks.
Definition Negamax.H:246
Minimal requirement for search moves.
and
Check uniqueness with explicit hash + equality functors.
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.
One trace event produced by an adversarial search.
Definition Negamax.H:226

Detailed Description

Concept for adversarial-search trace sinks.

Definition at line 245 of file Negamax.H.