Copyright	(c) Ghais Issa 2021
Safe Haskell	None
Language	Haskell2010

Poker.Holdem.Simulate

Description

Uses Monte Carlo Methods to determine the probability for each player in a game winning. The simulation randomize each of the unknown cards in the game, this could include any number of players' cards as well as flop, turn and river.

Synopsis

data Player = Player {
- card1 :: Maybe Card
- card2 :: Maybe Card
}
data Game = Game {
- players :: [Player]
- flop :: Maybe Flop
- turn :: Maybe Turn
- street :: Maybe Street
}
simulate :: RandomSource m DevRandom => Int -> Game -> m [Double]

Documentation

data Player Source #

A player can have 0, 1, 2 known cards.

Constructors

Player
Fields card1 :: Maybe Card card2 :: Maybe Card

data Game Source #

An abstraction that represents a poker game, with some unknowns. This allows us to simulate a game from any possible state.

Constructors

Game
Fields players :: [Player] Players. flop :: Maybe Flop The flop if known. Nothing otherwise. turn :: Maybe Turn The turn if known. Nothing otherwise. street :: Maybe Street The street if known. Nothing otherwise.

simulate Source #

Arguments

:: RandomSource m DevRandom
=> Int	Number of trajectories.
-> Game	State of the game before simulation.
-> m [Double]	Probability for each player winning the game.

Run a Monte Carlo simulation of a game returning the probability of winning for each player.