Two-slot killer heuristic table indexed by search depth. More...

Detailed Description

template<typename Move, bool Supported = std::equality_comparable<Move>>
class Aleph::Killer_Move_Table< Move, Supported >

Two-slot killer heuristic table indexed by search depth.

This implementation is intentionally small: each depth keeps two recent cutoff-producing moves. Engines can query the table while ordering a batch and record a move when it triggers a cutoff.

Template Parameters

Move	Move type.
Supported	Internal marker for equality support.

Definition at line 106 of file search_move_ordering.H.

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

search_move_ordering.H