bishbosh-0.1.1.0: Plays chess.
Safe HaskellNone
LanguageHaskell2010

BishBosh.Search.SearchState

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 Source #

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

Instances

Instances details
Show (SearchState x y positionHash) Source # 
Instance details

Defined in BishBosh.Search.SearchState

Methods

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

show :: SearchState x y positionHash -> String #

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

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 #

Functions

Constructors

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

Constructor.

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

Smart constructor.