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

Result of one iterative-deepening iteration. More...

#include <Negamax.H>

Collaboration diagram for Aleph::AdversarialIterativeDeepeningIteration< Move, Score >:

Public Attributes
size_t	depth = 0
	Horizon reached by this iteration.
bool	used_aspiration_window = false
	Whether the iteration started from a bounded window.
size_t	aspiration_researches = 0
	Number of retries triggered by aspiration failure.
Score	aspiration_alpha = Score{}
	Final lower bound used in the last search attempt.
Score	aspiration_beta = Score{}
	Final upper bound used in the last search attempt.
AdversarialSearchResult< Move, Score >	result
	Final result returned for this depth.
AdversarialSearchStats	total_stats
	Aggregate cost of all attempts at this depth.

Detailed Description

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

Result of one iterative-deepening iteration.

Definition at line 337 of file Negamax.H.

Member Data Documentation

aspiration_alpha

template<SearchMove Move, AdversarialScore Score>

Score Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::aspiration_alpha = Score{}

Final lower bound used in the last search attempt.

Definition at line 342 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

aspiration_beta

template<SearchMove Move, AdversarialScore Score>

Score Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::aspiration_beta = Score{}

Final upper bound used in the last search attempt.

Definition at line 343 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

aspiration_researches

template<SearchMove Move, AdversarialScore Score>

size_t Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::aspiration_researches = 0

Number of retries triggered by aspiration failure.

Definition at line 341 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

depth

template<SearchMove Move, AdversarialScore Score>

size_t Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::depth = 0

Horizon reached by this iteration.

Definition at line 339 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

result

template<SearchMove Move, AdversarialScore Score>

AdversarialSearchResult<Move, Score> Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::result

Final result returned for this depth.

Definition at line 344 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

total_stats

template<SearchMove Move, AdversarialScore Score>

AdversarialSearchStats Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::total_stats

Aggregate cost of all attempts at this depth.

Definition at line 345 of file Negamax.H.

Referenced by Aleph::adversarial_search_detail::run_iterative_deepening().

used_aspiration_window

template<SearchMove Move, AdversarialScore Score>

bool Aleph::AdversarialIterativeDeepeningIteration< Move, Score >::used_aspiration_window = false

Whether the iteration started from a bounded window.

Definition at line 340 of file Negamax.H.

---

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

• Negamax.H