More advanced API for finding probabilities via CardDrawTree

[leun4m]

This is quite a general issue and should be split up into multiple tasks.

Idea is to have the possibility to search through all possible results with:

• none
• any
• all

taking a function as param e.g. Fn(CardDrawSequence) -> bool

[leun4m]

Currently all that is necessary to check if a poker deck has only a pair of aces:

fn create_card_deck() -> CardDeck<(&str, &str)> {
    let mut cards = Vec::new();
    for suit in ["♦", "♥", "♠", "♣"] {
        for value in [
            "2", "3", "4", "5", "6", "7", "8", "9", "10", "B", "D", "K", "A",
        ] {
            cards.push((suit, value));
        }
    }
    CardDeck::from(cards)
}

#[test]
fn poker_hand_just_aces() {
    let deck = create_card_deck();
    let tree = CardDrawTree::shrinking(&deck, 2);
    let probability: Probability = tree
        .paths()
        .iter()
        .filter(|seq| {
            seq.cards().iter().all(|card| match card {
                (_, "A") => true,
                _ => false,
            })
        })
        .map(|seq| seq.probability().ratio())
        .sum::<Ratio<u64>>()
        .into();
    assert_eq!(probability, Probability::new(6, 1326));
}

Quite heavy...

[leun4m]

Also it should be noted, that this can make use of the graph to get to results more efficiently. For example you don't need to iterate further subnodes if a none is already not fulfilled at the current one.