O top-left proven optimum when known ✓ top-left counting upper bound reached when no stronger optimum is encoded T top-right curated target/literature target U bottom-left counting upper bound tiny blue superscripts on T labels link into the literature reference table below when a source is curatedRR round robin NKTS nearly Kirkman triple system MOLR Latin-rectangle lower bound from explicit MOLS ownSG starter-block own-social-golfer construction RITD resolvable incomplete transversal design PSB published schedule bankT when a target is present; otherwise progress to U| g\p | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| 1 | v T∞ ∞ | v T1 1 | v T1 1 | v T1 1 | v T1 1 | v T1 1 | v T1 1 | v T1 1 | v T1 1 | v T1 1 |
| 2 | v T∞ ∞ | |||||||||
| 3 | v T∞ ∞ | |||||||||
| 4 | v T∞ ∞ | |||||||||
| 5 | v T∞ ∞ | |||||||||
| 6 | v T∞ ∞ | |||||||||
| 7 | v T∞ ∞ | |||||||||
| 8 | v T∞ ∞ | |||||||||
| 9 | v T∞ ∞ | |||||||||
| 10 | v T∞ ∞ |
| g\p | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| 11 | v ∞ | |||||||||
| 12 | v ∞ | |||||||||
| 13 | v ∞ | |||||||||
| 14 | v ∞ | |||||||||
| 15 | v ∞ | |||||||||
| 16 | v ∞ | |||||||||
| 17 | v ∞ | |||||||||
| 18 | v ∞ | |||||||||
| 19 | v ∞ | |||||||||
| 20 | v ∞ |
| g\p | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 |
|---|---|---|---|---|---|---|---|---|---|---|
| 11 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |
| 12 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||
| 13 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||
| 14 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||||
| 15 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||||
| 16 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||||||
| 17 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||||||
| 18 | ✓ U1 1 1W | ✓ U1 1 1W | ||||||||
| 19 | ✓ U1 1 1W | |||||||||
| 20 |
| g\p | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| 21 | v ∞ | |||||||||
| 22 | v ∞ | |||||||||
| 23 | v ∞ | |||||||||
| 24 | v ∞ | |||||||||
| 25 | v ∞ | |||||||||
| 26 | v ∞ | |||||||||
| 27 | v ∞ | |||||||||
| 28 | v ∞ | |||||||||
| 29 | v ∞ | |||||||||
| 30 | v ∞ |
| g\p | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 |
|---|---|---|---|---|---|---|---|---|---|---|
| 21 | ||||||||||
| 22 | ||||||||||
| 23 | ||||||||||
| 24 | ||||||||||
| 25 | ||||||||||
| 26 | ||||||||||
| 27 | ||||||||||
| 28 | ||||||||||
| 29 | ||||||||||
| 30 |
| g\p | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 |
|---|---|---|---|---|---|---|---|---|---|---|
| 21 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |
| 22 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||
| 23 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||
| 24 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||||
| 25 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||||
| 26 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | ||||||
| 27 | ✓ U1 1 1W | ✓ U1 1 1W | ✓ U1 1 1W | |||||||
| 28 | ✓ U1 1 1W | ✓ U1 1 1W | ||||||||
| 29 | ✓ U1 1 1W | |||||||||
| 30 |
| g\p | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| 31 | v ∞ | |||||||||
| 32 | v ∞ | |||||||||
| 33 | v ∞ | |||||||||
| 34 | v ∞ | |||||||||
| 35 | v ∞ | |||||||||
| 36 | v ∞ | |||||||||
| 37 | v ∞ | |||||||||
| 38 | v ∞ | |||||||||
| 39 | v ∞ | |||||||||
| 40 | v ∞ |
| g\p | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|
| 41 | v ∞ | |||||||||
| 42 | v ∞ | |||||||||
| 43 | v ∞ | |||||||||
| 44 | v ∞ | |||||||||
| 45 | v ∞ | |||||||||
| 46 | v ∞ | |||||||||
| 47 | v ∞ | |||||||||
| 48 | v ∞ | |||||||||
| 49 | v ∞ | |||||||||
| 50 | v ∞ |
| Code | Stands for | Families / cells it can solve |
|---|---|---|
RR | round robin / 1-factorization | implemented `p=2` route across the scored matrix |
KTS(6t+3) | Kirkman triple system on `6t+3` players | implemented `p=3` family on `v = 6t+3` players via the shipped Kirkman constructor |
KTS | Kirkman triple system | literature/reference `p=3` targets where a Kirkman triple-system route is the intended benchmark |
NKTS | nearly Kirkman triple system | literature/reference `p=3` composite-row targets that need nearly-Kirkman constructions |
MOLS | explicit mutually orthogonal Latin squares with a distinguished resolution square | catalog-backed non-prime-power transversal constructions where one explicit Latin square indexes the parallel classes and the remaining squares provide symbol groups |
MOLSx | direct-product mutually orthogonal Latin squares | composite transversal constructions built from direct products of smaller prime-power MOLS banks, again using one product square as the parallel-class index |
RTD-QDM | resolvable transversal design from a quasi-difference matrix | catalog-backed non-prime-power RTD constructions built by expanding an explicit quasi-difference matrix into a resolvable orthogonal array and then reading off the parallel classes |
MOLR | mutually orthogonal Latin rectangles from an explicit MOLS bank | Sharma-Das lower-bound constructions that use the first k rows of an explicit MOLS bank to produce g+1 rounds, with optional extra clique rounds when the unused rows support them |
ownSG | starter-block own-social-golfer construction | catalog-backed Appendix A starter-block development family; currently covers large `10-p` rows such as `10-6-7`, `10-7-7`, `10-8-5`, and `10-9-5` |
RITD | resolvable incomplete transversal design | catalog-backed incomplete-transversal route where deleting one source group yields complete parallel classes, optionally followed by an intra-group filler week such as the shipped `10-5-9` construction |
MOLR+G | MOLR / MOLS lower-bound route with group fill | catalog-backed non-prime-power square-order route that extends a compatible 3-round `10-10` base with one latent-group filler week, matching the shipped `10-10-4` lower bound |
DM | cyclic partite difference matrix | catalog-backed exact zero-repeat constructions expanded from certified modular difference-matrix artifacts |
DM+K | difference matrix plus leave-graph clique factor | catalog-backed constructions that expand a cyclic partite difference matrix, then append stored K_group_size-factors from the leave graph |
RBIBD5 | block-size-5 resolvable balanced incomplete block design | validated explicit schedules whose method source is the RBIBD(v,5) spectrum `v ≡ 5 (mod 20)` outside the named exceptions |
RBIBD | catalog-backed resolvable balanced incomplete block design | explicit source-backed resolvable BIBD cases such as the shipped `RBIBD(120,8,1)` route for `15-8-17` |
DMA | Denniston maximal arc / resolvable BIBD finite-geometry construction | power-of-two cells `p=2^a`, `s=(g-1)/(p-1)=2^b` via an `RBIBD(qp-q+p,p,1)` from a Denniston maximal arc in `AG(2,q)`; includes `29-8-33` |
PSB | published schedule bank | explicit source-backed lower-bound schedules that are honest patch-bank constructions rather than general theorem families |
RTD | resolvable transversal design | implemented prime-power `g-p-w` cells with `3 <= p <= g`, excluding the diagonal affine-plane preference |
AP | affine-plane diagonal route | implemented diagonal prime-power cells `g-g-(g+1)` where affine planes are the preferred exact family |
AG | affine-space prime-power route | finite-geometry prime-power cells backed by affine-space constructions |
URD | uniformly resolvable design literature target | paper-derived supplementary targets whose cited achieving family is a URD row |
RGDD | catalog-backed resolvable group-divisible design | validated explicit schedules whose clean method source is a listed RGDD case, such as `RGDD(99,9,3)` for `11-9-12` |
RGDD4 | block-size-4 maximum-packing / RGDD spectrum route | p=4 maximum-packing cells explained by RBIBD(v,4), 4-RGDD type 3^(v/3), or 4-RGDD type 2^(v/2), excluding named small exceptions |
RBIBD4 | finite-field resolvable BIBD block-size-4 route | implemented `(v,4,1)` RBIBD construction for `v = 3q + 1` with supported prime-power `q`; retained as a lower-level backing route for the RGDD4 report family |
RTD+G | resolvable transversal design with recursive group-fill lift | implemented lifted cells where an RTD scaffold is filled from a smaller already-constructible instance |
VIS | visual-only marker | not a solver family; used only for cells outside the scored objective |
? | unknown / uncatalogued | fallback when a construction result is present but no explicit abbreviation is mapped |
| # | Citation | Notes |
|---|---|---|
[1] | Miller, A.; Valkov, I.; Abel, R.J.R. (2026). Combinatorial solutions to the Social Golfer Problem and Social Golfer Problem with adjacent group sizes. arXiv:2507.23376. | Used for the supplementary literature targets via Appendix B tables (including the additional v>150 examples), for canonical matrix family-backed roadmap targets, for Algorithm 1/2 family-selection rules, and for the paper's MOLS summary table. |