Good-Enough Golfers

Number of groups 0
People per group 0
Number of rounds 0
Player Names
Never allow these pairs

Good-Enough Golfers is a near-solver for a class of scheduling problems including the Social Golfer Problem and Kirkman's Schoolgirl Problem. The goal is to schedule g x p players into g groups of size p for w weeks such that no two players meet more than once.

Real solutions to these problems can be extremely slow, but approximations are fast and often good enough for real-world purposes.

Brad Buchanan, 2017 - Source on GitHub