Great work!

XP to next level

BugEater

Module 5: Introduction to Pairwise Combinations

Advanced Manual QA 208 XP 94 min

Updated: 07/07/2026

Start Module

Your feature has 6 parameters. Each has 3 possible values. That's 3⁶ = 729 combinations. Your sprint is two weeks. Nobody is writing 729 test cases.

But here's what research on real defects tells us: the overwhelming majority of bugs are caused by the interaction of two parameters, not three or more. This insight powers pairwise testing — a combinatorial technique that guarantees every pair of parameter values appears together in at least one test case, while keeping the test count manageable.

Lessons in this module

  1. The Combinatorial Explosion Problem — Understand why full combinatorial testing is impractical for any real feature. Calculate how test count grows with parameters and values. Make the case for smarter selection strategies.
  2. Pairwise Testing — The Math That Saves You — Learn the pairwise principle: why covering all 2-way interactions catches most real bugs. Understand how algorithms like PICT and AllPairs generate the minimum set of tests that covers every pair.
  3. Applying Pairwise to Real Features — Walk through a realistic example: a checkout feature with browser type, payment method, and shipping option. Build a pairwise test matrix, identify which pairs are covered, and understand the limitations.

Practice: Micro Discount Matrix

Three factors, two states each: new/returning customer, weekday/weekend, Product A/Product B. Eight complete combinations, but you only need four to cover all pairs. Find them.

By the end of this module, you will earn the Pair Optimizer badge.

Module content