Aleph::RankedMove< Move, Priority > Struct Template Reference

One move plus the metadata used by ordering comparators. More...

#include <search_move_ordering.H>

Collaboration diagram for Aleph::RankedMove< Move, Priority >:

Public Attributes
Move	move
	The candidate move.
Priority	priority = Priority{}
	Cheap heuristic priority (lower or higher depending on engine).
size_t	ordinal = 0
	Original order from successor generator (tie-breaker).
bool	killer = false
	True if this move matched a killer slot.
size_t	history_score = 0
	Accumulated history heuristic score.

Detailed Description

template<typename Move, typename Priority>
struct Aleph::RankedMove< Move, Priority >

One move plus the metadata used by ordering comparators.

Template Parameters

Move	Concrete move type.
Priority	Numeric type used for sorting (score or bound).

Definition at line 86 of file search_move_ordering.H.

Member Data Documentation

history_score

template<typename Move , typename Priority >

size_t Aleph::RankedMove< Move, Priority >::history_score = 0

Accumulated history heuristic score.

Definition at line 93 of file search_move_ordering.H.

killer

template<typename Move , typename Priority >

bool Aleph::RankedMove< Move, Priority >::killer = false

True if this move matched a killer slot.

Definition at line 92 of file search_move_ordering.H.

move

template<typename Move , typename Priority >

Move Aleph::RankedMove< Move, Priority >::move

The candidate move.

Definition at line 88 of file search_move_ordering.H.

Referenced by Aleph::Alpha_Beta< Domain >::collect_ordered_moves(), and Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::collect_ordered_moves().

ordinal

template<typename Move , typename Priority >

size_t Aleph::RankedMove< Move, Priority >::ordinal = 0

Original order from successor generator (tie-breaker).

Definition at line 91 of file search_move_ordering.H.

priority

template<typename Move , typename Priority >

Priority Aleph::RankedMove< Move, Priority >::priority = Priority{}

Cheap heuristic priority (lower or higher depending on engine).

Definition at line 89 of file search_move_ordering.H.

---

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

• search_move_ordering.H