Description
Generate a synthetic secret and guesses under explicit repetition rules with delegated duplicate-aware peg feedback, without claiming unique deduction.
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.
Generate a synthetic secret and guesses under explicit repetition rules with delegated duplicate-aware peg feedback, without claiming unique deduction.
When to use this tool
Use this generator to create reproducible mastermind round dataset 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 codeLength, symbolCount, allowRepetition, guessCount 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 secret, rounds. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Draw secret and guess vectors with symbols numbered zero through symbolCount minus one. If allowRepetition is false, sample distinct symbols per vector; otherwise draw each position independently. Delegate duplicate-aware Mastermind feedback for each guess.1
Delegated operations used for this result: mastermind black white peg feedback calculator. Their calculation or parsing conventions apply to the corresponding result fields.2
| Input field | Meaning and units | Accepted input |
|---|---|---|
| codeLength | Code Length | Required. Safe integer; minimum 1; maximum 16. |
| symbolCount | Symbol Count | Required. Safe integer; minimum 1; maximum 100. |
| allowRepetition | Whether a symbol may repeat within one code; guesses may repeat across rounds. | Required. Boolean. |
| guessCount | Guess Count | Required. Safe integer; minimum 1; 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 |
|---|---|---|
| secret | Secret | Required. Array of Safe integer.; minimum items 1; maximum items 16. |
| rounds | Rounds | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 64. |
| rounds[].guess | Guess | Required. Array of Safe integer.; minimum items 1; maximum items 16. |
| rounds[].feedback | Feedback | Required. Object; no unknown keys. |
| rounds[].feedback.blackExactPegs | Black Exact Pegs | Required. Safe integer. |
| rounds[].feedback.whiteMisplacedPegs | White Misplaced Pegs | Required. Safe integer. |
| rounds[].feedback.perPositionFeedback | Per Position Feedback | Required. Array of Safe integer.; minimum items 0; maximum items 16. |
| 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": {
"codeLength": 4,
"symbolCount": 4,
"allowRepetition": true,
"guessCount": 2,
"seed": 42
},
"output": {
"secret": [
2,
1,
3,
2
],
"rounds": [
{
"guess": [
0,
2,
1,
2
],
"feedback": {
"blackExactPegs": 1,
"whiteMisplacedPegs": 2,
"perPositionFeedback": [
0,
1,
1,
2
]
}
},
{
"guess": [
3,
1,
0,
3
],
"feedback": {
"blackExactPegs": 1,
"whiteMisplacedPegs": 1,
"perPositionFeedback": [
1,
2,
0,
0
]
}
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Without repetition, codeLength cannot exceed symbolCount. The secret is included for testing and must be withheld from players; random guesses do not constitute an adaptive solver.
- 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 Inference Rule Proof Cards Generator
Compose formal modus ponens, modus tollens, and hypothetical syllogism cards with fresh illustrative atoms and controlled invalid conclusions, delegating rule keys.
- Random Integer Partition Matching Puzzle Generator
Construct bounded positive or nonnegative integer compositions and optional canonical unordered partitions, retaining exact sum and conventions.