bishbosh-0.0.0.5: Plays chess.

Safe HaskellNone
LanguageHaskell2010

BishBosh.Model.PositionHashTree

Contents

Description

AUTHOR
Dr. Alistair Ward
DESCRIPTION
Synopsis

Types

Type-synonyms

Data-types

data PositionHashTree positionHash Source #

Wrap a BarePositionHashTree.

Instances
(FiniteBits positionHash, Num positionHash, Random positionHash) => Default (PositionHashTree positionHash) Source # 
Instance details

Defined in BishBosh.Model.PositionHashTree

Methods

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.

Constructors

mkPositionHashTree :: (Ix x, Bits positionHash, Enum x, Enum y, Ord y) => Zobrist x y positionHash -> GameTree x y -> PositionHashTree positionHash Source #

Hash the specified 'game-tree/.