Description
Construct distinct four-feature ternary card triples and an exact distractor count with delegated SET validity keys and no artwork.
A generated practice exercise contains a prompt and an answer key under a specific rule set. A planted answer establishes one possible solution; only an explicit enumeration or uniqueness check establishes whether alternatives exist.
Construct distinct four-feature ternary card triples and an exact distractor count with delegated SET validity keys and no artwork.
When to use this tool
Use this generator to create reproducible set triple recognition quiz cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply count, invalidCount in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read questions. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Draw two distinct four-feature ternary cards and calculate the unique third card making each feature all same or all different. For the exact requested invalid count, mutate one feature without duplicating another card. Delegate validity and feature flags, then shuffle questions.1
Delegated operations used for this result: set card all same or all different checker. Their calculation or parsing conventions apply to the corresponding result fields.2
| Input field | Meaning and units | Accepted input |
|---|---|---|
| count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer; minimum 1; maximum 64. |
| invalidCount | Invalid Count | Required. Safe integer; minimum 0; maximum 64. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| questions | Questions | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 64. |
| questions[].cards | Cards | Required. Array of Array of Safe integer; minimum 0; maximum 2.; minimum items 4; maximum items 4.; minimum items 3; maximum items 3. |
| questions[].validSet | Valid Set | Required. Boolean. |
| questions[].featureFlags | Feature Flags | Required. Array of Safe integer.; minimum items 4; maximum items 4. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"count": 1,
"invalidCount": 1,
"seed": 42
},
"output": {
"questions": [
{
"cards": [
[
1,
2,
1,
0
],
[
0,
0,
1,
0
],
[
2,
1,
1,
1
]
],
"validSet": false,
"featureFlags": [
1,
1,
1,
0
]
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- invalidCount cannot exceed count. Cards are numeric feature vectors with no artwork or rules beyond the four-feature ternary test; the answer key should be hidden during practice.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random KenKen Cage Arithmetic Quiz Generator
Generate a positive-target KenKen cage question and every valid hidden-cell replacement using cage arithmetic only, without global Latin-square constraints.
- Random Linear Congruence Practice Set Generator
Generate bounded linear congruences with exact delegated residue/period keys and enumerate every solution class modulo the supplied generated modulus.