bishbosh-0.0.0.7: Plays chess.
Safe HaskellNone
LanguageHaskell2010

BishBosh.Search.DynamicMoveData

Description

AUTHOR
Dr. Alistair Ward
DESCRIPTION
Synopsis

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.

Instances

Instances details
(Eq x, Eq y) => Eq (KillerMoveKey x y) Source # 
Instance details

Defined in BishBosh.Search.DynamicMoveData

Methods

(==) :: KillerMoveKey x y -> KillerMoveKey x y -> Bool #

(/=) :: KillerMoveKey x y -> KillerMoveKey x y -> Bool #

(Ord x, Ord y) => Ord (KillerMoveKey x y) Source # 
Instance details

Defined in BishBosh.Search.DynamicMoveData

(Show x, Show y) => Show (KillerMoveKey x y) Source # 
Instance details

Defined in BishBosh.Search.DynamicMoveData

data DynamicMoveData x y positionHash Source #

The data on moves, gathered while searching.

Instances

Instances details
Empty (DynamicMoveData x y positionHash) Source # 
Instance details

Defined in BishBosh.Search.DynamicMoveData

Methods

empty :: DynamicMoveData x y positionHash Source #

Functions

Constructors

Mutators

updateTranspositions :: Transformation (Move x y) positionHash -> Transformation x y positionHash Source #

Mutator.

euthanise Source #

Arguments

:: 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.