Safe Haskell | Safe |
---|---|

Language | Haskell2010 |

## Synopsis

- data T move state
- build :: (state -> [(move, state)]) -> state -> T move state
- mapNodesLeaves :: (state0 -> state1) -> (state0 -> state1) -> T move state0 -> T move state1
- mapTrees :: (a -> b) -> [(c, a)] -> [(c, b)]
- maximumMove :: Ord score => T move score -> move
- maximumMoveFast :: Ord score => T move score -> move
- minimumMove :: Ord score => T move score -> move
- minimumMoveFast :: Ord score => T move score -> move
- pruneVolume :: Int -> T move state -> T move state
- pruneDepth :: Int -> T move state -> T move state
- selectDeepSubTree :: Eq move => [move] -> T move state -> T move state
- selectSubTree :: Eq move => move -> T move state -> T move state
- state :: T move state -> state
- subTrees :: T move state -> [(move, T move state)]
- scanChildren :: ([(move, T move state)] -> [(move, T move state)]) -> T move state -> T move state

# Documentation

mapNodesLeaves :: (state0 -> state1) -> (state0 -> state1) -> T move state0 -> T move state1 Source #

maximumMove :: Ord score => T move score -> move Source #

maximumMoveFast :: Ord score => T move score -> move Source #

minimumMove :: Ord score => T move score -> move Source #

minimumMoveFast :: Ord score => T move score -> move Source #