Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- https://chessprogramming.wikispaces.com/Killer+Heuristic.
- type Transformation killerMove = KillerMoves killerMove -> KillerMoves killerMove
- data KillerMoves killerMove
- sortByHistoryHeuristic :: Ord killerMove => LogicalColour -> (a -> killerMove) -> KillerMoves killerMove -> [a] -> [a]
- insert :: Ord killerMove => NPlies -> killerMove -> Transformation killerMove
Types
Type-synonyms
type Transformation killerMove = KillerMoves killerMove -> KillerMoves killerMove Source #
The type of a function which transforms a collection of killer-moves.
Data-types
data KillerMoves killerMove Source #
- Used to contain the number of instances of each killer-move (a quiet move which triggered beta-cutoff), indexed by the logical-colour of the player making the move & the number of plies into the game, at which it occurred.
- These data can be used to advance the evaluation of identical sibling moves, in the hope of achieving beta-cutoff sooner.
Empty (KillerMoves killerMove) Source # | |
EphemeralData (KillerMoves killerMove) Source # | |
Functions
sortByHistoryHeuristic Source #
:: Ord killerMove | |
=> LogicalColour | |
-> (a -> killerMove) | Constructor. |
-> KillerMoves killerMove | |
-> [a] | |
-> [a] |
Sorts an arbitrary list using the History-heuristic; https://chessprogramming.wikispaces.com/History+Heuristic.