Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- The state which is threaded through successive calls to
search
.
Synopsis
- data SearchState x y positionHash
- mkSearchState :: PositionHashQuantifiedGameTree x y positionHash -> DynamicMoveData x y positionHash -> SearchState x y positionHash
- initialise :: PositionHashQuantifiedGameTree x y positionHash -> SearchState x y positionHash
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
Show (SearchState x y positionHash) Source # | |
Defined in BishBosh.Search.SearchState 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 # | |
Defined in BishBosh.Search.SearchState 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.