License | MIT |
---|---|
Maintainer | Joe Leslie-Hurd <joe@gilith.com> |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Documentation
newtype PlayerState s Source #
PlayerState (s, s) |
getPlayerState :: PlayerState s -> Player -> s Source #
updatePlayerState :: (s -> (a, s)) -> PlayerState s -> Player -> (a, PlayerState s) Source #
dfsWith :: Ord p => DfsPre p a v -> DfsPost p a v -> Val p v -> Player -> p -> (v, Val p v) Source #
delayForce :: Force -> Force Source #
forcedWith :: Ord p => Game p -> Player -> (Player -> p -> Bool) -> Forced p -> Player -> p -> (Force, Forced p) Source #
gameMaxWith :: (Ord p, Ord v) => Game p -> Player -> (Player -> p -> v) -> Val p (Max v) -> Player -> p -> (Max v, Val p (Max v)) Source #
gameMax :: (Ord p, Ord v) => Game p -> Player -> (Player -> p -> v) -> Player -> p -> Val p (Max v) Source #
applyStrategy :: Strategy p -> [p] -> [(Weight, p)] Source #
weightlessStrategy :: [p] -> [(Weight, p)] Source #
idStrategy :: Strategy p Source #
noStrategy :: Strategy p Source #
tryStrategy :: Strategy p -> Strategy p Source #
filterStrategy :: (p -> Bool) -> Strategy p Source #
maxStrategy :: Ord v => (p -> v) -> Strategy p Source #
validateStrategy :: Ord p => Game p -> Solve p -> Player -> Strategy p -> Player -> p -> StrategyFail p Source #
type Adversaries p = PlayerState [(Strategy p, ProbWin p)] Source #
probWinWith :: Ord p => Game p -> Player -> Strategy p -> ProbWin p -> Player -> p -> (Prob, ProbWin p) Source #
moveDist :: Ord p => Game p -> Solve p -> Adversaries p -> Player -> p -> ([(Prob, p)], Adversaries p) Source #