Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- type Transformation x y positionHash = DynamicMoveData x y positionHash -> DynamicMoveData x y positionHash
- data KillerMoveKey x y
- data DynamicMoveData x y positionHash
- mkKillerMoveKeyFromTurn :: Turn x y -> KillerMoveKey x y
- updateKillerMoves :: Transformation (KillerMoveKey x y) -> Transformation x y positionHash
- updateTranspositions :: Transformation (Move x y) positionHash -> Transformation x y positionHash
- euthanise :: NPlies -> MaybeRetireAfterNMoves -> MaybeRetireAfterNMoves -> Transformation x y positionHash
Types
Type-synonyms
type Transformation x y positionHash = DynamicMoveData x y positionHash -> DynamicMoveData x y positionHash Source #
The type of a function which transforms the dynamic move-data.
Data-types
data KillerMoveKey x y Source #
- Killer-moves are indexed by both the move & the rank of the piece which made it.
- CAVEAT: there's still ambiguity in this key, since it may match either a different piece of the same rank or have a different move-type (though typically only quiet moves are recorded), in sibling games.
data DynamicMoveData x y positionHash Source #
The data on moves, gathered while searching.
Empty (DynamicMoveData x y positionHash) Source # | |
Functions
Constructors
mkKillerMoveKeyFromTurn :: Turn x y -> KillerMoveKey x y Source #
Constructor.
Mutators
updateKillerMoves :: Transformation (KillerMoveKey x y) -> Transformation x y positionHash Source #
Mutator.
updateTranspositions :: Transformation (Move x y) positionHash -> Transformation x y positionHash Source #
Mutator.
:: NPlies | The number of plies currently applied to the game. |
-> MaybeRetireAfterNMoves | The number of full moves after which killer-moves should be retired. |
-> MaybeRetireAfterNMoves | The number of full moves after which transpositions should be retired. |
-> Transformation x y positionHash |
Remove archaic data.