bishbosh-0.0.0.6: Plays chess.

Safe HaskellNone
LanguageHaskell2010

BishBosh.Search.SearchState

Contents

Description

AUTHOR
Dr. Alistair Ward
DESCRIPTION
The state which is threaded through successive calls to search.
Synopsis

Types

Data-types

data SearchState x y positionHash criterionValue weightedMean Source #

The data which is both received & returned by select, so that it is transported through the entire game.

Instances
(Enum x, Enum y, Ord x, Ord y, Show x, Show y, Show criterionValue, Show positionHash, Show weightedMean) => Show (SearchState x y positionHash criterionValue weightedMean) Source # 
Instance details

Defined in BishBosh.Search.SearchState

Methods

showsPrec :: Int -> SearchState x y positionHash criterionValue weightedMean -> ShowS #

show :: SearchState x y positionHash criterionValue weightedMean -> String #

showList :: [SearchState x y positionHash criterionValue weightedMean] -> ShowS #

Functions

euthanise :: NPlies -> MaybeRetireAfterNMoves -> MaybeRetireAfterNMoves -> SearchState x y positionHash criterionValue weightedMean -> SearchState x y positionHash criterionValue weightedMean Source #

Forwards request.

Constructors

mkSearchState :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> DynamicMoveData x y positionHash -> SearchState x y positionHash criterionValue weightedMean Source #

Constructor.

initialise :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> SearchState x y positionHash criterionValue weightedMean Source #

Constructor.