Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- The state which is threaded through successive calls to
search
.
Synopsis
- data SearchState positionHash
- mkSearchState :: PositionHashQuantifiedGameTree positionHash -> DynamicMoveData positionHash -> SearchState positionHash
- initialise :: PositionHashQuantifiedGameTree positionHash -> SearchState positionHash
Types
Data-types
data SearchState positionHash Source #
The data which is both received & returned by search
, so that it is transported through the entire game.
Instances
Show (SearchState positionHash) Source # | |
Defined in BishBosh.Search.SearchState showsPrec :: Int -> SearchState positionHash -> ShowS # show :: SearchState positionHash -> String # showList :: [SearchState positionHash] -> ShowS # | |
MaybeEphemeralData (SearchState positionHash) Source # | |
Defined in BishBosh.Search.SearchState maybeEuthanise :: NPlies -> MaybeRetireAfterNMoves -> MaybeRetireAfterNMoves -> SearchState positionHash -> SearchState positionHash Source # |
Functions
Constructors
mkSearchState :: PositionHashQuantifiedGameTree positionHash -> DynamicMoveData positionHash -> SearchState positionHash Source #
Constructor.
initialise :: PositionHashQuantifiedGameTree positionHash -> SearchState positionHash Source #
Smart constructor.