Solving the Social Golfer Problem with Prolog
The social golfer problem is a sports scheduling task. Prolog is extremely well suited for solving such combinatorial decision and optimization problems: We benefit from strong constraint propagation that efficiently prunes the search space, and we can also conveniently try other approaches such as SAT encodings and heuristic methods.
More information: https://www.metalevel.at/sgp/