| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
BishBosh.Model.PositionHashTree
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION
Synopsis
- data PositionHashTree positionHash
- countDistinctPositions :: Ord positionHash => Depth -> PositionHashTree positionHash -> NPositions
- mkPositionHashTree :: Bits positionHash => Zobrist positionHash -> GameTree -> PositionHashTree positionHash
Types
Type-synonyms
Data-types
data PositionHashTree positionHash Source #
Wrap a BarePositionHashTree.
Instances
| (FiniteBits positionHash, Random positionHash) => Default (PositionHashTree positionHash) Source # | |
Defined in BishBosh.Model.PositionHashTree Methods def :: PositionHashTree positionHash # | |
Functions
countDistinctPositions :: Ord positionHash => Depth -> PositionHashTree positionHash -> NPositions Source #
Count the number of distinct positions, irrespective of the sequence of moves taken to reach that terminal state.
Constructors
mkPositionHashTree :: Bits positionHash => Zobrist positionHash -> GameTree -> PositionHashTree positionHash Source #
Hash the specified 'game-tree/.