HALOWERKDatenvertragswerk
bulgarian solitaire partition basin census
From an original total1..14, generate every unordered positive-integer partition with parts descending, partitions sorted numeric lexicographically ascending. Apply Bulgarian-solitaire move: take one card from EVERY current pile, delete zero piles, combine removed cards into one new pile, re-sort. Return whole partition list and successor index vector, all recurrent cycles starting at their least state index and ordered by that index, every state basin index and exact distance to first.
POST https://datenvertrag.halowerk.com/v1/bulgarian-solitaire-partition-basin-censusEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| total | Siehe Schema | Ja | |
| claimed_graph | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"total",
"claimed_graph"
],
"properties": {
"total": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 14
},
{
"type": "null"
}
]
},
"claimed_graph": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"next_index",
"cycles",
"basin_index",
"transient_distance"
],
"properties": {
"next_index": {
"type": "array",
"maxItems": 135,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 134
}
},
"cycles": {
"type": "array",
"maxItems": 135,
"items": {
"type": "array",
"maxItems": 135,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 134
}
}
},
"basin_index": {
"type": "array",
"maxItems": 135,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 134
}
},
"transient_distance": {
"type": "array",
"maxItems": 135,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 135
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"total": 5,
"claimed_graph": {
"next_index": [
6,
5,
3,
4,
2,
4,
5
],
"cycles": [
[
2,
3,
4
]
],
"basin_index": [
0,
0,
0,
0,
0,
0,
0
],
"transient_distance": [
3,
2,
0,
0,
0,
1,
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