| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
BishBosh.Search.KillerMoves
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION- https://www.chessprogramming.org/Killer_Heuristic.
Synopsis
- type Transformation killerMoveKey = KillerMoves killerMoveKey -> KillerMoves killerMoveKey
- data KillerMoves killerMoveKey
- sortByHistoryHeuristic :: Ord killerMoveKey => LogicalColour -> (a -> killerMoveKey) -> KillerMoves killerMoveKey -> [a] -> [a]
- insert :: Ord killerMoveKey => NPlies -> killerMoveKey -> Transformation killerMoveKey
Types
Type-synonyms
type Transformation killerMoveKey = KillerMoves killerMoveKey -> KillerMoves killerMoveKey Source #
The type of a function which transforms a collection of killer-moves.
Data-types
data KillerMoves killerMoveKey Source #
Data which can be used to advance the evaluation of identical sibling moves, in the hope of achieving beta-cutoff sooner.
Instances
| Empty (KillerMoves killerMoveKey) Source # | |
Defined in BishBosh.Search.KillerMoves Methods empty :: KillerMoves killerMoveKey Source # | |
| EphemeralData (KillerMoves killerMoveKey) Source # | |
Defined in BishBosh.Search.KillerMoves Methods getSize :: KillerMoves killerMoveKey -> Int Source # euthanise :: NPlies -> KillerMoves killerMoveKey -> KillerMoves killerMoveKey Source # | |
Functions
sortByHistoryHeuristic Source #
Arguments
| :: Ord killerMoveKey | |
| => LogicalColour | |
| -> (a -> killerMoveKey) | Key-constructor. |
| -> KillerMoves killerMoveKey | |
| -> [a] | |
| -> [a] |
Sorts an arbitrary list using the History-heuristic; https://www.chessprogramming.org/History_Heuristic.