Our Genetic Algorithm
Social Golfer uses a genetic algorithm with local search optimization. The computation runs entirely
on your device (browser or mobile), optimized for mobile hardware.
Runtime complexity: approximately O(rounds × permutations × explored_options × group_size²)
Real-world example: Scheduling 200 players playing weekly for a year generates approximately
1.5 billion permutation from 50 random starting points. This resolves in roughly
15 seconds on a modern smartphone.
The algorithm detects when conflicts become necessary (mathematically unavoidable repeat pairings) and can escape
local optima through randomized restarts when the search conflicts are too high (resuts shown per calculation).