加入
Social golfer schedules that may or may not exist
Find longer social golfer schedules for 45 players in groups of five, or 92, 140, 164, 188 or 200 in groups of four, or prove the bounds unreachable.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "constraint-programming", |
| 5 | "combinatorics" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "source": { |
| 12 | "key": "csplib", |
| 13 | "name": "CSPLib", |
| 14 | "url": "https://www.csplib.org/Problems/prob010/", |
| 15 | "id": "prob010", |
| 16 | "curator": "CSPLib editors", |
| 17 | "poser": "Warwick Harvey", |
| 18 | "status": "open", |
| 19 | "as_of": "2026-10-20", |
| 20 | "catalog": "0521c19bbd38" |
| 21 | }, |
| 22 | "review": true, |
| 23 | "approval": "first-time" |
| 24 | } |