Game.Mastermind

Documentation

data Eval

Constructors

Eval Int Int

Instances

Eq Eval

Methods

(==) :: Eval -> Eval -> Bool

(/=) :: Eval -> Eval -> Bool

Show Eval

Methods

showsPrec :: Int -> Eval -> ShowS

show :: Eval -> String

showList :: [Eval] -> ShowS

evaluate :: Ord a => [a] -> [a] -> Eval

Given the code and a guess, compute the evaluation.

histogram :: Ord a => [a] -> Map a Int

selectFromHistogram :: Ord a => Map a Int -> [(a, Map a Int)]

remainingSimple :: Ord a => Set a -> [a] -> Int -> [[Set a]]

A variant of the game: It is only possible to specify number of symbols at right places.

The results of remaining and remainingSimple cannot be compared.

possibleRightPlaces :: Int -> Int -> [[Bool]]

Combinatorical "choose k from n".

remaining :: (C set, Ord a) => Set a -> [a] -> Eval -> set a

Given a code and an according evaluation, compute the set of possible codes.

The Game.Mastermind game consists of collecting pairs of codes and their evaluations. The searched code is in the intersection of all corresponding code sets.

partitionSizes :: Ord a => Set a -> [a] -> [(Eval, Integer)]

possibleEvaluations :: Int -> [Eval]

interaction :: (T Char -> StateT state Maybe [Char]) -> state -> Set Char -> Int -> IO ()

mainSimple :: Set Char -> Int -> IO ()

randomSelect :: (RandomGen g, Monad m) => [a] -> StateT g m a

minimax :: Ord b => [(a, [b])] -> a

minimum of maximums using alpha-beta-pruning

randomizedAttempt :: (C set, RandomGen g, Ord a) => Int -> Set a -> set a -> StateT g Maybe [a]

mixedRandomizedAttempt :: (C set, RandomGen g, Ord a) => Int -> Set a -> set a -> StateT g Maybe [a]

In the beginning we simply choose a random code from the set of possible codes. In the end, when the set becomes small, then we compare different alternatives.

mainRandom :: Set Char -> Int -> IO ()

main :: IO ()