-
Notifications
You must be signed in to change notification settings - Fork 0
AI engines
This library provides the developer with some classical implementations of Minimax implementations.
TODO
This concept is very well explained in Wikipedia.
The transposition table policy implements the replacement strategy used to choose to replace or retain a previously stored record by a new one.
During a game, some moves are irreversible (typically when a pawn advances in chess).
As such moves are played, positions previously stored in the transposition table become less likely to be useful.
In order to manage this obsolescence of the transposition table entries, a generation number is attached to each record.
The transposition table policy can then take this information into account to choose whether to replace (or not) a position in the event of a collision.