Transposition_Table.H File Reference

Generic memoization / transposition-table support for state search. More...

#include <concepts>
#include <utility>
#include <state_search_common.H>

Include dependency graph for Transposition_Table.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	Aleph::TranspositionStats
	Statistics collected by memo/transposition storage. More...
struct	Aleph::Replace_Always< Entry >
	Minimal replacement policy: always replace the current entry. More...
struct	Aleph::Prefer_Deeper_Entry< Entry >
	Replacement policy that prefers entries searched to greater depth. More...
class	Aleph::Transposition_Table< Key, Entry, HashMapTable, Cmp, ReplacePolicy >
	Transposition-table container built on top of Aleph hash maps. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Concepts
concept	Aleph::TranspositionReplacementPolicy
	Minimal protocol for replacement policies.
concept	Aleph::MemoTable
	Minimal protocol for memo tables used by search engines.

Enumerations
enum class	Aleph::TranspositionBound { Aleph::Exact , Aleph::Lower_Bound , Aleph::Upper_Bound }
	Stored bound classification for memoized search entries. More...
enum class	Aleph::TranspositionStoreStatus { Aleph::Inserted , Aleph::Replaced , Aleph::Rejected }
	Outcome of one store/update attempt in a transposition table. More...

Detailed Description

Generic memoization / transposition-table support for state search.

This module keeps the storage layer intentionally small:

• a generic keyed transposition table over Aleph hash maps,
• reusable statistics for probes/stores/replacements,
• a minimal replacement-policy protocol,
• a concept for domains that can expose a stable state key.

The table itself is algorithm-agnostic. Specific engines such as Negamax or Alpha-Beta define their own entry types and decide when a cached entry is valid for reuse.

Author

Leandro Rabindranath León

Definition in file Transposition_Table.H.