The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.
The result was: promoted by Theleekycauldron (talk) 07:49, 20 September 2021 (UTC)
... that the social golfer problem is used to assign groups in classrooms to maximize student interaction? Source: "the social golfer problem with adjacent group sizes...We present our solutions for up to 50 students and introduce an online resource that educators can access to immediately generate suitable allocation schedules." MDPI
ALT1:... that 32 golfers can play in foursomes for 10 weeks without any two golfers playing together more than once? Source: "there are 32 social golfers, each of whom play golf once a week, and always in groups of 4. They would like you to come up with a schedule of play for these golfers, to last as many weeks as possible, such that no golfer plays in the same group as any other golfer on more than one occasion." CSPLib
Created/expanded by SoonLorpai (talk). Self-nominated at 07:33, 10 September 2021 (UTC).
Overall: Wow! What a cool math problem. I don´t prefer one hook over the other, so I leave it to the promoter´s discretion to choose. Only comment is second hook might be harder to read, but I think relatively simple to comprehend problems like these can be useful towards math education for a general public. A. C. Santacruz ⁂ Talk 11:15, 12 September 2021 (UTC)
Wow! What a cool math problem. I don´t prefer one hook over the other, so I leave it to the promoter´s discretion to choose. Only comment is second hook might be harder to read, but I think relatively simple to comprehend problems like these can be useful towards math education for a general public. A. C. Santacruz ⁂ Talk 11:15, 12 September 2021 (UTC)