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

Language | Haskell2010 |

AI strategies to direct actors not controlled directly by human players.
No operation in this module involves the `State`

tyep or any of our
client/server monads types.

- data Strategy a
- nullStrategy :: Strategy a -> Bool
- liftFrequency :: Frequency a -> Strategy a
- (.|) :: Strategy a -> Strategy a -> Strategy a
- reject :: Strategy a
- (.=>) :: Bool -> Strategy a -> Strategy a
- only :: (a -> Bool) -> Strategy a -> Strategy a
- bestVariant :: Strategy a -> Frequency a
- renameStrategy :: Text -> Strategy a -> Strategy a
- returN :: Text -> a -> Strategy a
- mapStrategyM :: Monad m => (a -> m (Maybe b)) -> Strategy a -> m (Strategy b)

# Documentation

A strategy is a choice of (non-empty) frequency tables of possible actions.

nullStrategy :: Strategy a -> Bool Source #

liftFrequency :: Frequency a -> Strategy a Source #

Strategy where only the actions from the given single frequency table can be picked.

(.|) :: Strategy a -> Strategy a -> Strategy a infixr 2 Source #

Strategy with the actions from both argument strategies, with original frequencies.

only :: (a -> Bool) -> Strategy a -> Strategy a Source #

Strategy with all actions not satisfying the predicate removed. The remaining actions keep their original relative frequency values.

bestVariant :: Strategy a -> Frequency a Source #

When better choices are towards the start of the list, this is the best frequency of the strategy.