| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
BishBosh.Search.SearchState
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION- The state which is threaded through successive calls to
search.
- data SearchState x y positionHash criterionValue weightedMean
- euthanise :: NPlies -> MaybeRetireAfterNMoves -> MaybeRetireAfterNMoves -> SearchState x y positionHash criterionValue weightedMean -> SearchState x y positionHash criterionValue weightedMean
- mkSearchState :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> DynamicMoveData x y positionHash -> SearchState x y positionHash criterionValue weightedMean
- initialise :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> SearchState x y positionHash criterionValue weightedMean
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.
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.