Zobrist keys compactly represent the state of perfect information games.
- data ZSet a = ZSet Word64 (ZArray a) (Set Word64)
- data ZMap k v = ZMap Word64 (ZArray k) (Map Word64 v)
- zSet :: Ix a => Word64 -> (a, a) -> Int -> ZSet a
- zMap :: forall a b. Ix a => Word64 -> (a, a) -> Int -> ZMap a b
- flipPos :: Ix a => a -> ZSet a -> Maybe (ZSet a)
- zArray :: Ix a => Word64 -> (a, a) -> Int -> ZArray a
Documentation
Sets of board states, indexed by zobrist keys
Maps from board states, indexed by zobrist keys
:: Ix a | |
=> Word64 | Seed to use for random number generation |
-> (a, a) | Bounds for piece position values |
-> Int | Total number of piece positions |
-> ZSet a |
Construct a ZSet
:: forall a b . Ix a | |
=> Word64 | Seed to use for random number generation |
-> (a, a) | Bounds for piece position values |
-> Int | Total number of piece positions |
-> ZMap a b |
Construct a ZMap