Combinatorics.CardPairs

general

data Card

Constructors

Other

Queen

King

Instances

Enum Card

Methods

succ :: Card -> Card

pred :: Card -> Card

toEnum :: Int -> Card

fromEnum :: Card -> Int

enumFrom :: Card -> [Card]

enumFromThen :: Card -> Card -> [Card]

enumFromTo :: Card -> Card -> [Card]

enumFromThenTo :: Card -> Card -> Card -> [Card]

Eq Card

Methods

(==) :: Card -> Card -> Bool

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

Ord Card

Methods

compare :: Card -> Card -> Ordering

(<) :: Card -> Card -> Bool

(<=) :: Card -> Card -> Bool

(>) :: Card -> Card -> Bool

(>=) :: Card -> Card -> Bool

max :: Card -> Card -> Card

min :: Card -> Card -> Card

Show Card

Methods

showsPrec :: Int -> Card -> ShowS

show :: Card -> String

showList :: [Card] -> ShowS

data CardCount i

Constructors

CardCount

Fields

• otherCount, queenCount, kingCount :: i

Instances

Eq i => Eq (CardCount i)

Methods

(==) :: CardCount i -> CardCount i -> Bool

(/=) :: CardCount i -> CardCount i -> Bool

Ord i => Ord (CardCount i)

Methods

compare :: CardCount i -> CardCount i -> Ordering

(<) :: CardCount i -> CardCount i -> Bool

(<=) :: CardCount i -> CardCount i -> Bool

(>) :: CardCount i -> CardCount i -> Bool

(>=) :: CardCount i -> CardCount i -> Bool

max :: CardCount i -> CardCount i -> CardCount i

min :: CardCount i -> CardCount i -> CardCount i

Show i => Show (CardCount i)

Methods

showsPrec :: Int -> CardCount i -> ShowS

show :: CardCount i -> String

showList :: [CardCount i] -> ShowS

Ix i => Ix (CardCount i)

Methods

range :: (CardCount i, CardCount i) -> [CardCount i]

index :: (CardCount i, CardCount i) -> CardCount i -> Int

unsafeIndex :: (CardCount i, CardCount i) -> CardCount i -> Int

inRange :: (CardCount i, CardCount i) -> CardCount i -> Bool

rangeSize :: (CardCount i, CardCount i) -> Int

unsafeRangeSize :: (CardCount i, CardCount i) -> Int

charFromCard :: Card -> Char

allPossibilities :: CardSet a -> [[a]]

numberOfAllPossibilities :: CardCount Int -> Integer

possibilitiesCardsNaive :: CardCount Int -> Integer

possibilitiesCardsDynamic :: CardCount Int -> Array (CardCount Int) Integer

possibilitiesCardsBorderNaive :: CardCount Int -> CardCount Integer

Count the number of card set orderings with adjacent queen and king. We return a triple where the elements count with respect to an additional condition: (card set starts with an ordinary card ' ', start with queen q, start with king k)

possibilitiesCardsBorderDynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer)

possibilitiesCardsBorder2Dynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer)

examples

cardSetSizeSkat :: CardCount Int

numberOfPossibilitiesSkat :: Integer

probabilitySkat :: Double

cardSetSizeRummy :: CardCount Int

numberOfPossibilitiesRummy :: Integer

probabilityRummy :: Double

cardSetSizeRummyJK :: CardCount Int

Allow both Jack and King adjacent to Queen.

numberOfPossibilitiesRummyJK :: Integer

probabilityRummyJK :: Double

tests

testCardsBorderDynamic :: (CardCount Integer, CardCount Integer, CardCount Integer)

exampleOutput :: IO ()

adjacentCouplesSmall :: [[Card]]

allPossibilitiesSmall :: [[Card]]

allPossibilitiesMedium :: [[Card]]

allPossibilitiesSkat :: [[Card]]