Examples
Examples
Try the starting example
- Parameters: name, allowed values joined by |
- A,0|1 B,0|1 C,0|1
- Forbidden pairs: parameter, value, different parameter, value; or none
- none
- Greedy pair-covering test configurations
- 1: A=0 / B=0 / C=0; 2: A=0 / B=1 / C=1; 3: A=1 / B=0 / C=1; 4: A=1 / B=1 / C=0
- Valid full configurations under supplied constraints
- 8
- Distinct feasible two-parameter value pairs
- 12
- Chosen test rows
- 4
- Feasible-pair coverage (%)
- 100
Try another scenario
- Parameters: name, allowed values joined by |
- A,0|1 B,0|1 C,0|1
- Forbidden pairs: parameter, value, different parameter, value; or none
- A,1,B,1
- Greedy pair-covering test configurations
- 1: A=0 / B=0 / C=0; 2: A=0 / B=1 / C=1; 3: A=1 / B=0 / C=1; 4: A=0 / B=1 / C=0; 5: A=1 / B=0 / C=0
- Valid full configurations under supplied constraints
- 6
- Distinct feasible two-parameter value pairs
- 11
- Chosen test rows
- 5
- Feasible-pair coverage (%)
- 100
Calculation method
Calculation method
Greedy pair-covering test configurations
Enumerate valid full configurations, repeatedly choose the row covering most uncovered feasible pairs, input-enumeration ties.
Valid full configurations under supplied constraints
Count Cartesian rows that violate no supplied forbidden pair.
Distinct feasible two-parameter value pairs
A pair is required only if some valid complete configuration contains it.
Chosen test rows
Count greedy-selected configurations; minimality is not claimed.
Feasible-pair coverage (%)
All feasible required pairs are covered by the returned proposal.
Symbols and units
- a
- Parameters: name, allowed values joined by |
- b
- Forbidden pairs: parameter, value, different parameter, value; or none
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- A bounded deterministic feasible pair-covering proposal, not an optimal covering array or a guarantee of higher-order fault detection. Two to six parameters, up to four values each, and at most 512 full configurations.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
NIST: combinatorial testing and coverage measurement; audit rules are explicitly supplied ↗
Background reading; this does not imply endorsement or independent review of SumFizz.