HALOWERKDatenvertragswerk
rook board placement polynomial
For a complete binary board with0to4rows and0to4columns, enumerate all placements using only allowed1cells, with at most one rook per row and per column. Return the complete coefficient vector r0..rmin(rows,columns), counting each cardinality with zero bins; all placement masks and all ordered(row,column)pairs, total and maximum rook count. Bit(row*columns+column) names a cell; placements sort numerically by mask. The empty placement always exists, including empty dimensions or blocked.
POST https://datenvertrag.halowerk.com/v1/rook-board-placement-polynomialEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| rows | integer | Ja | |
| columns | integer | Ja | |
| board | Siehe Schema | Ja | |
| claimed_coefficients | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"rows",
"columns",
"board",
"claimed_coefficients"
],
"properties": {
"rows": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"columns": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"board": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
}
},
{
"type": "null"
}
]
},
"claimed_coefficients": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 209
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"rows": 3,
"columns": 3,
"board": [
[
0,
1,
1
],
[
1,
0,
1
],
[
1,
1,
0
]
],
"claimed_coefficients": [
1,
6,
9,
2
]
}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