Random Nonogram Line Completion Puzzle Generator

Description

Generate a binary Nonogram line with hidden cells and exact bounded completion counts and forced-cell answers.

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 binary Nonogram line with hidden cells and exact bounded completion counts and forced-cell answers.

When to use this tool

Use this generator to create reproducible nonogram line completion 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 length, hiddenCount 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 puzzle, answer, feasibility. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Draw a binary line, calculate filled-run clues, and hide distinct cells. Exhaustively enumerate all bounded-length binary lines agreeing with visible cells and clues, reporting completionCount, uniqueness, and cells shared by every completion.^[1]

Delegated operations used for this result: nonogram clue sum plus gaps length checker. Their calculation or parsing conventions apply to the corresponding result fields.^[2]

Input field	Meaning and units	Accepted input
length	Length	Required. Safe integer; minimum 1; maximum 16.
hiddenCount	Hidden Count	Required. Safe integer; minimum 0; maximum 16.
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
puzzle	Puzzle	Required. Object; no unknown keys.
puzzle.clues	Clues	Required. Array of Safe integer.; minimum items 0; maximum items 16.
puzzle.cells	Cells	Required. Array of Safe integer; minimum 0; maximum 1. or Null.; minimum items 0; maximum items 16.
answer	Answer	Required. Object; no unknown keys.
answer.solution	Solution	Required. Array of Safe integer; minimum 0; maximum 1.; minimum items 0; maximum items 16.
answer.completionCount	Completion Count	Required. Safe integer.
answer.unique	Unique	Required. Boolean.
answer.forcedCells	Forced Cells	Required. Array of Safe integer; minimum 0; maximum 1. or Null.; minimum items 0; maximum items 16.
feasibility	Feasibility	Required. Object; no unknown keys.
feasibility.minimumRequiredLineCells	Minimum Required Line Cells	Required. Safe integer.
feasibility.signedRemainingSlackCells	Signed Remaining Slack Cells	Required. Safe integer.
feasibility.lineLengthFeasible	Line Length Feasible	Required. Boolean.
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": {
    "length": 6,
    "hiddenCount": 2,
    "seed": 42
  },
  "output": {
    "puzzle": {
      "clues": [
        1,
        2,
        1
      ],
      "cells": [
        1,
        null,
        1,
        null,
        0,
        1
      ]
    },
    "answer": {
      "solution": [
        1,
        0,
        1,
        1,
        0,
        1
      ],
      "completionCount": 1,
      "unique": true,
      "forcedCells": [
        1,
        0,
        1,
        1,
        0,
        1
      ]
    },
    "feasibility": {
      "minimumRequiredLineCells": 6,
      "signedRemainingSlackCells": 0,
      "lineLengthFeasible": true
    },
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

Null in the puzzle means hidden and null in forcedCells means not forced. A planted solution is always retained but uniqueness is not guaranteed. Exhaustive enumeration is intentionally limited to short lines.
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 Integer Partition Matching Puzzle Generator
Construct bounded positive or nonnegative integer compositions and optional canonical unordered partitions, retaining exact sum and conventions.
Random Kakuro Run Completion Exercise Generator
Generate a distinct-digit Kakuro run with hidden cells and all feasible unordered remaining digit sets, without assuming ordered uniqueness.