Game.Tree

Documentation

data T move state

Constructors

Cons

Fields

• state :: state
• subTrees :: [(move, T move state)]

Instances

Functor (T move)

Methods

fmap :: (a -> b) -> T move a -> T move b

(<$) :: a -> T move b -> T move a

(Read move, Read state) => Read (T move state)

Methods

readsPrec :: Int -> ReadS (T move state)

readList :: ReadS [T move state]

readPrec :: ReadPrec (T move state)

readListPrec :: ReadPrec [T move state]

(Show move, Show state) => Show (T move state)

Methods

showsPrec :: Int -> T move state -> ShowS

show :: T move state -> String

showList :: [T move state] -> ShowS

mapTrees :: (a -> b) -> [(c, a)] -> [(c, b)]

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

scanChildren :: ([(move, T move state)] -> [(move, T move state)]) -> T move state -> T move state

build :: (state -> [(move, state)]) -> state -> T move state

selectSubTree :: Eq move => move -> T move state -> T move state

selectDeepSubTree :: Eq move => [move] -> T move state -> T move state

pruneDepth :: Int -> T move state -> T move state

pruneVolume :: Int -> T move state -> T move state

maximise :: Ord score => T move score -> score

minimise :: Ord score => T move score -> score

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

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

maximiseFast :: Ord score => T move score -> [score]

minimiseFast :: Ord score => T move score -> [score]

mapMaximum :: Ord score => [[score]] -> [score]

mapMinimum :: Ord score => [[score]] -> [score]

sortChildrenAsc :: Ord score => T move score -> T move score

sortChildrenDesc :: Ord score => T move score -> T move score

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

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