Naar de inhoud
OneKitly

A Tricast Is Six Times Harder Than Picking the Same Three Horses

Gepubliceerd op 16-11-2026 · 3 min leestijd · Sportcalculators

Aisha Karim

Aisha Karim — Redacteur fitness en hardlopen bij OneKitly

Hardlopen · Training

Getoetst aan 2 bronnen

Profiel bekijken →
Kort gezegd

With ten runners, the number of ways the first three places can be filled in a specified order is 10 × 9 × 8, which is 720. The number of ways to pick the same three finishers without caring who came first is 120, because each set of three can be arranged in 6 orders. So a bet on the exact finishing order is six times harder to win than a bet on the same three horses in any order, and any price that does not reflect that factor is mispriced. The rule generalises: ordering r items multiplies the difficulty by r factorial.

Advertentie

Ten runners give 720 possible podiums in order and 120 unordered sets. The factor of six is 3 factorial — the number of ways to shuffle a podium.

Why the count falls off a cliff

Each extra place multiplies rather than adds. Predicting the first four of ten takes 5040 outcomes, the first five takes 30 240, and the full finishing order of all ten takes 3 628 800. That last number is why a complete-order bet is never offered and why a random guess at the full order of a ten-horse field is a once-in-a-lifetime event even for someone betting daily. Multiplication is the reason ordering problems escape human intuition so fast.

Where the assumption of equal chances breaks

Counting outcomes only gives a probability when every outcome is equally likely, and in a real race they are not: the favourite wins far more than one time in ten. The count remains useful as a comparison — the exact order really is six times harder than the unordered set, whatever the individual chances — but converting 720 into odds of 720 to 1 assumes a field of identical horses. That is the single most common misuse of a counting formula, and it appears far outside sport.

Outcomes
Ten runners, three places
BetOutcomesChance at random
Winner only101 in 10
Three in any order1201 in 120
Three in exact order7201 in 720

Uitgewerkt met onze eigen calculator

Permutatiecalculator (nPr)

Gegeven

n (totaal)
20
r (gekozen)
6

Resultaat

nPr
27.907.200

Deze cijfers komen uit de calculator hieronder, ze zijn niet met de hand ingetypt — ze worden opnieuw berekend telkens als de tool verandert.

Reken het door met je eigen cijfers →
Advertentie

Veelgestelde vragen

What if two runners are withdrawn?
The count falls to 8 × 7 × 6, or 336, less than half of the original 720. Removing runners helps the ordered bet disproportionately, because every place in the product shrinks at once. That is why non-runners change a tricast price far more than a win price, and why bets placed before declarations carry a different risk from bets placed after them. Two withdrawals from ten is a twenty per cent reduction in the field and a fifty-three per cent reduction in the difficulty.
Does the same maths cover a race with ties?
No, and dead heats are exactly why betting rules contain a special clause. The counting formula assumes a strict order with no ties, so a dead heat for second produces an outcome the formula says cannot happen. Bookmakers resolve it by paying a fraction of the stake rather than by recomputing anything, which is a commercial decision rather than a mathematical one. Any model of a race that cannot express a tie will fail on the day one occurs.

Artikelen die je misschien interesseren

Alle gidsen →

Vergelijkbare tools

Bronnen

Een fout in dit artikel gezien?