Skip to content

Main content

Random Weaving Color Thread Plan Generator

Shuffle exact supplied warp/weft color quotas and apply a caller lift matrix to a bounded visible-color grid; fabric behavior and loom setup remain external.

Loading tool…

Description

Shuffle exact supplied warp/weft color quotas and apply a caller lift matrix to a bounded visible-color grid; fabric behavior and loom setup remain external.

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.

Shuffle exact supplied warp/weft color quotas and apply a caller lift matrix to a bounded visible-color grid; fabric behavior and loom setup remain external.

When to use this tool

Use this generator to create reproducible weaving color thread plan 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 warp, weft, lift 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 warp, weft, colorIds, visibleChart, chartJson, warpCounts, weftCounts, visibleCounts. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Expand exact warp/weft color quotas and independently shuffle each axis. Require lift dimensions to match thread counts; for each cell select the warp color when lift is one and the weft color otherwise. Return color-index chart and exact axis/visible counts.1

Input fieldMeaning and unitsAccepted input
warpWarpRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 16.
warp[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 80.
warp[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 0; maximum 128.
weftWeftRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 16.
weft[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 80.
weft[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 0; maximum 128.
liftLiftRequired. Array of Array of Safe integer; minimum 0; maximum 1.; minimum items 1; maximum items 16.; minimum items 1; maximum items 16.
seedOptional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.Optional. Safe integer.
Output fieldInterpretationReturned shape
warpWarpRequired. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 80.; minimum items 1; maximum items 16.
weftWeftRequired. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 80.; minimum items 1; maximum items 16.
colorIdsColor IdsRequired. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 80.; minimum items 1; maximum items 16.
visibleChartVisible ChartRequired. Array of Array of Safe integer; minimum 0; maximum 15.; minimum items 1; maximum items 16.; minimum items 1; maximum items 16.
chartJsonChart JsonRequired. Text; maximum UTF-16 length 2048.
warpCountsWarp CountsRequired. Array of Object; no unknown keys.; minimum items 0; maximum items 32.
warpCounts[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 80.
warpCounts[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 0; maximum 128.
weftCountsWeft CountsRequired. Array of Object; no unknown keys.; minimum items 0; maximum items 32.
weftCounts[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 80.
weftCounts[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 0; maximum 128.
visibleCountsVisible CountsRequired. Array of Object; no unknown keys.; minimum items 0; maximum items 32.
visibleCounts[].idLiteral identifier used to match records, independently of their display labels.Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 80.
visibleCounts[].countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 0; maximum 128.
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": {
    "warp": [
      {
        "id": "red",
        "count": 2
      }
    ],
    "weft": [
      {
        "id": "blue",
        "count": 2
      }
    ],
    "lift": [
      [
        1,
        0
      ],
      [
        0,
        1
      ]
    ],
    "seed": 42
  },
  "output": {
    "warp": [
      "red",
      "red"
    ],
    "weft": [
      "blue",
      "blue"
    ],
    "colorIds": [
      "red",
      "blue"
    ],
    "visibleChart": [
      [
        0,
        1
      ],
      [
        1,
        0
      ]
    ],
    "chartJson": "[[0,1],[1,0]]",
    "warpCounts": [
      {
        "id": "red",
        "count": 2
      }
    ],
    "weftCounts": [
      {
        "id": "blue",
        "count": 2
      }
    ],
    "visibleCounts": [
      {
        "id": "red",
        "count": 2
      },
      {
        "id": "blue",
        "count": 2
      }
    ],
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

  • Each axis contains one through sixteen threads, with bounded color count. This is a visibility chart under the supplied lift matrix, not a loom setup, float-length analysis or prediction of fabric behavior.
  • 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 Weaving Color Thread Plan Generator — tool.io

Similar or alternative tools

  • Random Mesh Color Pattern Generator

    Generate random hex control nodes and a shared-edge bilinear encoded-sRGB color grid via the existing interpolator, retaining its numeric precision and byte quantization; this is a rectangular mesh approximation, not a perceptual or linear-light blend.

  • Random Paper Chain Color Order Plan Generator

    Construct an exact-length caller-color link sequence under run and undirected adjacency rules with bounded cyclic-order search and per-color counts.