Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
Synopsis
- data PositionHashTree positionHash
- countDistinctPositions :: Ord positionHash => Depth -> PositionHashTree positionHash -> NGames
- mkPositionHashTree :: (Ix x, Bits positionHash, Enum x, Enum y, Ord y) => Zobrist x y positionHash -> GameTree x y -> PositionHashTree positionHash
Types
Type-synonyms
Data-types
data PositionHashTree positionHash Source #
Wrap a BarePositionHashTree
.
Instances
(FiniteBits positionHash, Num positionHash, Random positionHash) => Default (PositionHashTree positionHash) Source # | |
Defined in BishBosh.Model.PositionHashTree def :: PositionHashTree positionHash # |
Function
countDistinctPositions :: Ord positionHash => Depth -> PositionHashTree positionHash -> NGames Source #
Count the number of distinct games, irrespective of the sequence of moves taken to reach that state.