The mode is not the mean
A discrete distribution can have expected count between integers while its most likely row is a whole count.
Probability
Generate a complete exact table for every feasible target-card count, cumulative probability and count-specific score.
CARD OUTCOME DISTRIBUTION
This calculator constructs the full hypergeometric outcome table for one hand. Each row shows the count, combination factors, exact and cumulative probability, a count-specific net score, and its contribution to expected score. It is useful when the decision depends on the shape of all outcomes rather than one tail.
CARD OUTCOME DISTRIBUTION
Use the table when modal, tail, cumulative, or score outcomes matter differently. Expected score is an average over repeated identical hands and does not describe volatility, utility, bankroll, or a guarantee.

| Target cards drawn | Target-card combinations | Other-card combinations | Exact probability (%) | Cumulative probability (%) | Net score | Expected-score contribution |
|---|
CURRENT CALCULATION PROCESS
P(X=k)=C(K,k)C(N−K,n−k)/C(N,n); E[score]=Σ[(ak−c)P(X=k)]
Every feasible target count is enumerated. Exact combinations define row probability, cumulative probability is a running sum, and count-specific score is points per target minus the fixed hand cost.
Exact combination counts are retained before display rounding.
HOW TO USE THIS MODEL
CARD OUTCOME DISTRIBUTION FUNDAMENTALS
MODEL AND FORMULA
Every feasible target count is enumerated. Exact combinations define row probability, cumulative probability is a running sum, and count-specific score is points per target minus the fixed hand cost.
DEEPER PROBABILITY ANALYSIS
A discrete distribution can have expected count between integers while its most likely row is a whole count.
For score ak−c, E[score]=aE[X]−c. The row sum provides an independent reconciliation of that shortcut.
Outcome-count entropy increases when probability is distributed across more plausible counts; it says nothing about whether those outcomes are desirable.
WORKED DECISION CASES
A five-card hand receives points for each heart and pays a fixed entry score. The table shows every possible heart count and its contribution to expected score.
An instructor changes target-card count and hand size to show how finite-population support, mode, mean, and cumulative probability move together.
TECHNICAL LANGUAGE
EVIDENCE AND DATA LINEAGE
Retain deck composition, target definition, draw rule, hand size, scoring rule, fixed cost, combination counts, unrounded row probabilities, cumulative totals, and any removed or known cards. A changed scoring rule can reuse probabilities but creates a new decision table.
LIMITS AND EXCLUSIONS
RELIABLE SOURCES
FREQUENTLY ASKED QUESTIONS
It is a long-run probability-weighted average, not the count in one hand. Individual hands still have whole-card counts.
If the hand is larger than the number of non-target cards, at least one or more targets are forced. The support reflects that constraint.
No. This table accumulates from the minimum through k, giving P(X≤k). An upper tail is one minus the cumulative probability below the threshold.
Yes for a linear penalty model. Confirm that the actual rule is truly additive and uses the same fixed cost for every outcome.
It summarizes dispersion among target-count outcomes in bits. It is not confidence, expected score, risk tolerance, or randomness quality.
They expose the exact numerator structure and make each probability auditable against the total number of possible hands.
IMPORTANT PROBABILITY NOTE
The distribution is exact only for the entered finite-deck model and random without-replacement draw. Verify real rules and known cards. Expected score and probability do not guarantee profit or justify wagering.