Combinatorial explosion is the rapid growth in the number of possible combinations as variables and their values increase. Even simple systems can have millions of combinations, far too many to test exhaustively.
Why it matters: It explains why testing can't find every bug, and why techniques like pairwise testing exist. Showing the numbers helps stakeholders understand why an apparently obvious bug was missed.
In practice: Testers estimate how many combinations exist, then use risk, pairwise or combinatorial testing techniques to choose a manageable subset. A simple worked example is often the clearest way to explain the scale to non-testers.
Examples:
- Twelve folders and files, each with three possible permissions, creating over 14 million combinations.
- Using pairwise testing to choose a manageable subset of browser and operating system combinations.
Common pitfalls:
- Trying to automate every combination, when the number is too large even for machines.
- Picking combinations at random, rather than by risk or technique.
How do you test when there are too many combinations? Use techniques like pairwise testing, which cover every pair of values with far fewer tests, and focus on the combinations most likely to matter to users.
