Skip to content

Main content

Random String Art Pin Pattern Generator

Generate numbered pin connections with bounded multiset search, exact degree and repetition constraints, and full-precision lengths; a continuous threading walk is not required.

Loading tool…

Description

Generate numbered pin connections with bounded multiset search, exact degree and repetition constraints, and full-precision lengths; a continuous threading walk is not required.

Procedural artwork expresses a visual idea through coordinates, repeated motifs, colors, or explicit placement constraints. A coordinate plan can be checked and reproduced before rendering, while physical material behavior and fabrication require separate information.

Generate numbered pin connections with bounded multiset search, exact degree and repetition constraints, and full-precision lengths; a continuous threading walk is not required.

When to use this tool

Use this generator to create reproducible string art pin pattern 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

  1. Supply pins, connectionCount, minimumDegree, maximumDegree, maximumPairRepetition in the field shapes below. Set seed when you need an explicit replay.
  2. 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.
  3. Read connections, degrees, pairCounts, totalLength. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Search over unordered pin pairs and allowed multiplicities until the exact connection count and per-pin degree bounds are met. Return repeated connections as separate numbered steps, pair lengths, degree totals, and total string length.1

Delegated operations used for this result: distance. Their calculation or parsing conventions apply to the corresponding result fields.2

Input fieldMeaning and unitsAccepted input
pinsPinsRequired. Array of Object; no unknown keys.; minimum items 2; maximum items 12.
pins[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
pins[].xXRequired. Finite number.
pins[].yYRequired. Finite number.
connectionCountConnection CountRequired. Safe integer; minimum 1; maximum 64.
minimumDegreeMinimum DegreeRequired. Safe integer; minimum 0; maximum 128.
maximumDegreeMaximum DegreeRequired. Safe integer; minimum 0; maximum 128.
maximumPairRepetitionMaximum Pair RepetitionRequired. Safe integer; minimum 1; maximum 8.
seedOptional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.Optional. Safe integer.
Output fieldInterpretationReturned shape
connectionsConnectionsRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 64.
connections[].stepStepRequired. Safe integer; minimum 1; maximum 64.
connections[].fromFromRequired. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
connections[].toToRequired. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
connections[].lengthLengthRequired. Finite number; minimum 0.
degreesDegreesRequired. Array of Object; no unknown keys.; minimum items 2; maximum items 12.
degrees[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
degrees[].degreeDegreeRequired. Safe integer; minimum 0; maximum 64.
pairCountsPair CountsRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 64.
pairCounts[].fromFromRequired. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
pairCounts[].toToRequired. Text; minimum UTF-16 length 1; maximum UTF-16 length 64.
pairCounts[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 1; maximum 8.
totalLengthTotal LengthRequired. Finite number; minimum 0.
randomnessReplay 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.seedOptional numeric replay seed; normalization and precedence are explained below.Required. Safe integer. or Null.
randomness.sourceSourceRequired. 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": {
    "pins": [
      {
        "id": "a",
        "x": 0,
        "y": 0
      },
      {
        "id": "b",
        "x": 3,
        "y": 0
      },
      {
        "id": "c",
        "x": 3,
        "y": 4
      }
    ],
    "connectionCount": 3,
    "minimumDegree": 2,
    "maximumDegree": 2,
    "maximumPairRepetition": 1,
    "seed": 42
  },
  "output": {
    "connections": [
      {
        "step": 1,
        "from": "a",
        "to": "b",
        "length": 3
      },
      {
        "step": 2,
        "from": "a",
        "to": "c",
        "length": 5
      },
      {
        "step": 3,
        "from": "b",
        "to": "c",
        "length": 4
      }
    ],
    "pairCounts": [
      {
        "from": "a",
        "to": "b",
        "count": 1
      },
      {
        "from": "a",
        "to": "c",
        "count": 1
      },
      {
        "from": "b",
        "to": "c",
        "count": 1
      }
    ],
    "degrees": [
      {
        "id": "a",
        "degree": 2
      },
      {
        "id": "b",
        "degree": 2
      },
      {
        "id": "c",
        "degree": 2
      }
    ],
    "totalLength": 12,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

  • Bounded randomized search may reject infeasible or excessive work and does not sample all feasible layouts uniformly. The multigraph is not necessarily a continuous threading route; physical construction remains a separate review.
  • 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

  1. Tool behavior and example: Random String Art Pin Pattern Generator — tool.io

  2. Calculation or validation: geometry/distance — tool.io

Similar or alternative tools