The rule
If a process has several stages, and there are a ways to do the first, b ways to do the second, and c ways to do the third, then the whole process can be done in a × b × c ways. The rule works when the number of options at each stage does not depend on which option you picked at an earlier stage.
It sounds almost too simple, yet it underlies a large share of probability calculations.
Example 1: building a character
A game asks you to pick a class from 4, a weapon from 5 and a colour scheme from 3. Every combination is allowed.
4 × 5 × 3 = 60 different builds
You could list the 60, but multiplying is faster and less error-prone. If the game adds one more class, the total becomes 5 × 5 × 3 = 75, with no need to start over.
Example 2: rolling dice
Two six-sided dice give 6 × 6 = 36 ordered outcomes. Three dice give 6 × 6 × 6 = 216. Each added die multiplies the total by 6.
Because every die face is equally likely, each of the 36 ordered pairs has probability 1/36. This is how dice odds are built: the total number of outcomes comes from the multiplication principle, and the number of outcomes meeting the condition comes from counting. For instance, the sum of 7 can occur in 6 of the 36 ordered pairs (1+6, 2+5, 3+4, 4+3, 5+2, 6+1), so the probability is 6/36 = 1/6. That count is also why some two-dice sums are more common than others.
Example 3: PIN codes
A 4-digit PIN where each position can be any digit from 0 to 9 allows 10 × 10 × 10 × 10 = 10,000 possibilities. If a code must not repeat any digit, the options shrink: 10 × 9 × 8 × 7 = 5,040.
This leads to an important distinction.
When the number of options shrinks
In the no-repeat PIN, the second stage has 9 options regardless of which digit was chosen first, so the multiplication principle still holds. What matters is that the number of options at each stage is fixed, even if the specific options change.
The same is true for dealing cards. If you deal two cards one after the other from a standard deck, there are 52 choices for the first and 51 for the second:
52 × 51 = 2,652 ordered two-card deals
If you only care which two cards you hold and not the order, divide by 2, giving 1,326 hands. The extra division is what separates permutations from combinations. The shrinking count (51 in place of 52) is the essence of drawing without replacement.
Example 4: a sequence of picks in a tournament
Say you rank 3 favourite games out of 8 candidates, first, second and third. There are 8 choices for first, 7 for second and 6 for third:
8 × 7 × 6 = 336 ranked lists
Using it for probability
When all outcomes are equally likely, the probability of an event is the number of outcomes in the event divided by the total number. The multiplication principle often gives both numbers.
Suppose you flip a coin 3 times and roll a die once. The total is 2 × 2 × 2 × 6 = 48 outcomes. How many have all three flips heads and the die showing an even number? There is 1 way for the flips (HHH) and 3 for the die (2, 4, 6), so 1 × 3 = 3 outcomes. The probability is 3/48 = 1/16.
You can check this another way: the chance of three heads is 1/8 and of an even die is 1/2, and 1/8 × 1/2 = 1/16. The two methods agree, which is no accident, since they reflect the same principle. This is also why the probability of independent events happening together is the product of their separate probabilities, as in independent and dependent events.
When the principle does not directly apply
- When choices depend on each other in ways that change the number of options. If picking one item removes a variable number of other items from consideration, a simple product may not work.
- When outcomes are not equally likely. A loot table that gives some items a higher chance than others needs weights. The total number of items is not enough, as with weighted tables.
- When order does not matter. Multiplication counts ordered sequences, so you may need to divide afterwards.
- When different paths overlap. If the same result can arise in more than one way, you may need inclusion-exclusion to avoid double counting.
Why totals explode
Multiplying grows totals fast. A game that creates a map from 10 independent features, each with 6 variants, can produce 6^10 = 60,466,176 layouts. This is part of why procedural generation can offer so many different results from a small set of building blocks. Whether those layouts are all equally likely or equally interesting is a separate question.
The multiplication principle only counts possibilities. Counting a very large number of outcomes does not mean a good result is likely, and in games with a built-in house edge, it does not alter the expected loss over time. Gambling can be harmful, and support services exist for anyone who needs them.