Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Haskell library for creating simple deterministic games, such as tic-tac-toe. The engine requires a minimal set of actions related to the game, and then will run the game until a terminal state is reached.
Simple generic example below. See the specs for a more detailed example.
import GameEngine game :: GameEngine Int Int game = GameEngine gameActions initialState gameActions :: GameActions Int Int gameActions = GameActions { getPlayer = -- find the next player from a game state, getMove = -- find a move from the game state, getResult = -- transitions from a state to another state, isTerminal = -- determines if the game is terminal, getScore = -- get score from a terminal state } initialState :: GameState Int initialState = GameState 0 -- run the game engine until a terminal state is reached playSimple game
- type Symbol = Char
- data GameState a = GameState a
- data Player = Player Symbol
- data Move a = Move a
- data GameActions a b = GameActions {}
- data GameEngine a b = GameEngine {
- actions :: GameActions a b
- state :: GameState a
- play :: Monad m => (GameState a -> m (GameState a)) -> GameEngine a b -> m Int
- playSimple :: GameEngine a b -> Int
- playIO :: (GameState a -> IO ()) -> GameEngine a b -> IO Int
Documentation
data GameActions a b Source
Set of actions that defines how the game will be played
GameActions | |
|
data GameEngine a b Source
Holds information about how the game is played, and the current state of the game.
GameEngine | |
|
play :: Monad m => (GameState a -> m (GameState a)) -> GameEngine a b -> m Int Source
Run the provided game engine under a monadic context until a terminal state is reached. Note: provided function should act as an identity only, and should not modify the game state.
playSimple :: GameEngine a b -> Int Source
Run the provided game engine without a context until a terminal state is reached.