Random Word Search Puzzle Generator

Description

Place caller-supplied ASCII words in a seeded bounded grid using selected compass directions, compatible crossings, and backtracking, then fill unused cells with random uppercase letters; return planted placements and a separate answer grid, without a unique-solution or no-accidental-word guarantee.

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.

When to use this tool

Use this generator to create reproducible word search puzzle 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 words, rows, columns, directions, maximumAttempts 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 grid, answerGrid, placements, attempts. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Normalize supplied ASCII words to uppercase, enumerate in-bounds placements in allowed compass directions and shuffle each candidate list. Place longer words first using bounded backtracking and compatible letter crossings, then fill unused cells with random uppercase letters and return planted placements plus a separate answer grid.^[1]

Delegated operations used for this result: letter; uppercase. Their calculation or parsing conventions apply to the corresponding result fields.^{[2, 3]}

Input field	Meaning and units	Accepted input
words	Words	Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 20.; minimum items 1; maximum items 16.
rows	Rows	Required. Safe integer; minimum 1; maximum 32.
columns	Columns	Required. Safe integer; minimum 1; maximum 32.
directions	Directions	Required. Array of Text; one of "E", "W", "N", "S", "NE", "NW", "SE", "SW".; minimum items 1; maximum items 8.
maximumAttempts	Maximum Attempts	Required. Safe integer; minimum 1; maximum 250000.
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
grid	Grid	Required. Array of Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 1.; minimum items 1; maximum items 32.; minimum items 1; maximum items 32.
answerGrid	Answer Grid	Required. Array of Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 1.; minimum items 1; maximum items 32.; minimum items 1; maximum items 32.
placements	Placements	Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16.
placements[].wordIndex	Word Index	Required. Safe integer; minimum 0; maximum 15.
placements[].word	Word	Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 20.
placements[].row	Row	Required. Safe integer; minimum 0; maximum 31.
placements[].column	Column	Required. Safe integer; minimum 0; maximum 31.
placements[].direction	Direction	Required. Text; one of "E", "W", "N", "S", "NE", "NW", "SE", "SW".
attempts	Attempts	Required. Safe integer; minimum 1; maximum 250000.
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.

json

{
  "input": {
    "words": [
      "ab",
      "c"
    ],
    "rows": 2,
    "columns": 2,
    "directions": [
      "E"
    ],
    "maximumAttempts": 100,
    "seed": 42
  },
  "output": {
    "grid": [
      [
        "A",
        "B"
      ],
      [
        "E",
        "C"
      ]
    ],
    "answerGrid": [
      [
        "A",
        "B"
      ],
      [
        ".",
        "C"
      ]
    ],
    "placements": [
      {
        "wordIndex": 0,
        "word": "AB",
        "row": 0,
        "column": 0,
        "direction": "E"
      },
      {
        "wordIndex": 1,
        "word": "C",
        "row": 1,
        "column": 1,
        "direction": "E"
      }
    ],
    "attempts": 3,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Words must remain distinct after normalization. Search attempts and enumeration work are bounded. Accidental extra words and alternate valid placements are possible; no unique-solution claim is made.
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

Tool behavior and example: Random Word Search Puzzle Generator — tool.io
Calculation or validation: random/letter — tool.io
Calculation or validation: text/uppercase — tool.io

Similar or alternative tools

Random Integer Partition Matching Puzzle Generator
Construct bounded positive or nonnegative integer compositions and optional canonical unordered partitions, retaining exact sum and conventions.
Random Nonogram Line Completion Puzzle Generator
Generate a binary Nonogram line with hidden cells and exact bounded completion counts and forced-cell answers.