Batting Order Rotation Calculator
Count how many distinct batting orders a team can make from its roster — a permutations problem, n choose the lineup arranged.
How it works
Distinct orders = P(n, k) = n × (n − 1) × … × (n − k + 1) = n! ÷ (n − k)!
A batting order is a permutation: order matters, because batting third is different from batting seventh. With n players and k spots, the first spot has n choices, the second n − 1, and so on down to the k-th spot — multiply those together for the count. This grows explosively, which is why even a modest roster yields an enormous number of possible lineups.
Worked example
From a 12-player roster filling 9 batting spots: 12 × 11 × 10 × 9 × 8 × 7 × 6 × 5 × 4 = 79,833,600 distinct orders — nearly 80 million ways to arrange the lineup.
Sources: Permutation — Wikipedia
Frequently asked questions
Why is this a permutation and not a combination?
Because the order of batters matters — the same nine players in a different sequence is a different lineup. Combinations count only which players are chosen, ignoring order, so they would undercount here.
What if every player bats (spots = roster)?
Then it is n! (n factorial) — every player in every possible order. For a 9-player roster batting all 9, that is 9! = 362,880 orders.
Does this account for positions in the field?
No — it counts only batting-order arrangements. Assigning defensive positions on top of the batting order would multiply the count further; this calculator focuses on the lineup sequence alone.
Related calculators
This calculator is for educational purposes. Double-check important results before acting on them.