HALOWERKDatenvertragswerk
partial latin completion family
For one FULLY CAPTURED indexed squareCLUEGRID of order1..3, with AT MOST4filledcells, reconstruct EVERY complete LATIN SQUARE agreeingwithALLgivenclues. cells is a flatROWMAJORarray ofexactlyorder*order entries; -1 is a KNOWN unfilledposition, not an unknownmeasurement. Otherentries are originalsymbolnames0..order-1. A completed square has eachsymbol exactlyonce inEACHrow andEACHcolumn. Conflicting repeatedclues withinarow/column are WELL-FORMED unsatisfiableassignments andreturn.
POST https://datenvertrag.halowerk.com/v1/partial-latin-completion-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| order | Siehe Schema | Ja | |
| cells | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"cells": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 2
},
"minItems": 1,
"maxItems": 9
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"solutions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 9
},
"minItems": 0,
"maxItems": 16
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"feasible": {
"type": "boolean"
}
},
"required": [
"solutions",
"count",
"feasible"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"order",
"cells",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"order": 1,
"cells": [
-1
],
"claim": {
"solutions": [
[
0
]
],
"count": 1,
"feasible": true
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden