Safe Haskell	Safe-Inferred
Language	Haskell98

Numeric.Probability.Example.MontyHall

Contents

Playing the game
Alternative modeling
Play the game the monadic way

Synopsis

data Door
- = A
- | B
- | C
doors :: [Door]
data State = Doors {
- prize :: Door
- chosen :: Door
- opened :: Door
}
start :: State
hide :: Trans State
choose :: Trans State
open :: Trans State
type Strategy = Trans State
switch :: Strategy
stay :: Strategy
game :: Strategy -> Trans State
data Outcome
- = Win
- | Lose
result :: State -> Outcome
eval :: Strategy -> Dist Outcome
simEval :: Int -> Strategy -> RDist Outcome
firstChoice :: Dist Outcome
switch' :: Trans Outcome
type StrategyM = Door -> Door -> Door
stayM :: StrategyM
switchM :: StrategyM
evalM :: StrategyM -> Dist Outcome

Documentation

data Door Source #

Constructors

A

B

C

Instances

Instances details

Show Door Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

showsPrec :: Int -> Door -> ShowS #

show :: Door -> String #

showList :: [Door] -> ShowS #

Eq Door Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

(==) :: Door -> Door -> Bool #

(/=) :: Door -> Door -> Bool #

Ord Door Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

compare :: Door -> Door -> Ordering #

(<) :: Door -> Door -> Bool #

(<=) :: Door -> Door -> Bool #

(>) :: Door -> Door -> Bool #

(>=) :: Door -> Door -> Bool #

max :: Door -> Door -> Door #

min :: Door -> Door -> Door #

doors :: [Door] Source #

data State Source #

Constructors

Doors

Fields

Instances

Instances details

Show State Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

showsPrec :: Int -> State -> ShowS #

show :: State -> String #

showList :: [State] -> ShowS #

Eq State Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

(==) :: State -> State -> Bool #

(/=) :: State -> State -> Bool #

Ord State Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

compare :: State -> State -> Ordering #

(<) :: State -> State -> Bool #

(<=) :: State -> State -> Bool #

(>) :: State -> State -> Bool #

(>=) :: State -> State -> Bool #

max :: State -> State -> State #

min :: State -> State -> State #

start :: State Source #

initial configuration of the game status

hide :: Trans State Source #

Steps of the game:

hide the prize
choose a door
open a non-open door, not revealing the prize
apply strategy: switch or stay

choose :: Trans State Source #

open :: Trans State Source #

type Strategy = Trans State Source #

switch :: Strategy Source #

stay :: Strategy Source #

game :: Strategy -> Trans State Source #

Playing the game

data Outcome Source #

Constructors

Win

Lose

Instances

Instances details

Show Outcome Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

showsPrec :: Int -> Outcome -> ShowS #

show :: Outcome -> String #

showList :: [Outcome] -> ShowS #

Eq Outcome Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

(==) :: Outcome -> Outcome -> Bool #

(/=) :: Outcome -> Outcome -> Bool #

Ord Outcome Source #

Instance details

Defined in Numeric.Probability.Example.MontyHall

Methods

compare :: Outcome -> Outcome -> Ordering #

(<) :: Outcome -> Outcome -> Bool #

(<=) :: Outcome -> Outcome -> Bool #

(>) :: Outcome -> Outcome -> Bool #

(>=) :: Outcome -> Outcome -> Bool #

max :: Outcome -> Outcome -> Outcome #

min :: Outcome -> Outcome -> Outcome #

result :: State -> Outcome Source #

eval :: Strategy -> Dist Outcome Source #

simEval :: Int -> Strategy -> RDist Outcome Source #

Alternative modeling

firstChoice :: Dist Outcome Source #

switch' :: Trans Outcome Source #

Play the game the monadic way

type StrategyM = Door -> Door -> Door Source #

stayM :: StrategyM Source #

switchM :: StrategyM Source #

evalM :: StrategyM -> Dist Outcome Source #