Social golfer problem

The Social Golfer Problem (SGP) is a classic combinatorial optimization problem that involves grouping players into teams for a golf tournament, where the goal is to maximize socialization (i.e., minimize repeated pairings) over multiple rounds. Here's how it works: 1. **Players and Groups**: You have a fixed number of players, often divided into groups of a specific size.