bishbosh-0.1.1.0: Plays chess.
Safe HaskellNone
LanguageHaskell2010

BishBosh.Search.EphemeralData

Contents

Description

AUTHOR
Dr. Alistair Ward
DESCRIPTION
Controls the growth of dynamic data collected during the search for a move.
Synopsis

Type-classes

class EphemeralData a where Source #

An interface for short-lived data.

Methods

getSize Source #

Arguments

:: a 
-> Int

Get the current size of the collection.

euthanise Source #

Arguments

:: NPlies 
-> a 
-> a

Prune items older than the specified number of plies, from the data.

Instances

Instances details
EphemeralData (KillerMoves killerMoveKey) Source # 
Instance details

Defined in BishBosh.Search.KillerMoves

Methods

getSize :: KillerMoves killerMoveKey -> Int Source #

euthanise :: NPlies -> KillerMoves killerMoveKey -> KillerMoves killerMoveKey Source #

EphemeralData (Transpositions qualifiedMove positionHash) Source # 
Instance details

Defined in BishBosh.Search.Transpositions

Methods

getSize :: Transpositions qualifiedMove positionHash -> Int Source #

euthanise :: NPlies -> Transpositions qualifiedMove positionHash -> Transpositions qualifiedMove positionHash Source #

class MaybeEphemeralData a where Source #

For data which can be killed.

Methods

maybeEuthanise Source #

Arguments

:: NPlies

The age at which to die.

-> MaybeRetireAfterNMoves

The optional age at which to retire killer-moves.

-> MaybeRetireAfterNMoves

The optional age at which to retire transpositions.

-> a 
-> a 

Instances

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

Defined in BishBosh.Search.DynamicMoveData

MaybeEphemeralData (SearchState x y positionHash) Source # 
Instance details

Defined in BishBosh.Search.SearchState

Methods

maybeEuthanise :: NPlies -> MaybeRetireAfterNMoves -> MaybeRetireAfterNMoves -> SearchState x y positionHash -> SearchState x y positionHash Source #