Gloss Tools

Switching language or leaving the page discards your draft.

Pairwise Test Matrix

Build a reproducible set of test cases that covers all pairs of values across the supplied dimensions.

One dimension per line, name:a|b format; 2–5 dimensions, 2–6 values each.

Format and limits
  • Each line is name:a|b: a dimension name starts with a letter and may contain letters, digits, - and _, up to 24 characters; values start with a letter or digit, also up to 24 characters.
  • Input is at most 1,024 characters; no spaces inside a line; dimension names and values within one dimension must not repeat.
  • The product of all value counts is at most 2,048; larger inputs are refused without enumeration.
  • Results are a deterministic greedy set picked by newly covered pairs. It does not guarantee the fewest cases; the download is a JSON report.
  • All computation happens locally. Nothing is uploaded or stored.

Frequently asked questions

Is this a minimum-case proof?

It selects a reproducible set based on newly covered pairs.

Does it include every combination?

All two-dimension pairs appear. Some full combinations may be absent.