Quote:
Originally Posted by JesseK
Yea that's what he's proposing. It's quite easy to debug algorithms that always deal with team #'s 1-N (or 0-N).
The only issue I see with developing all possible schedules is the aggregate size of the files, unless Blake's proposing ONE 'best' schedule for a given # of teams be used. If that's the case, then generating 80 'best' schedules could be done via team ID's (0-N, where N = # of teams) and then another algorithms simply randomizes the team lists at the events and assigns the ID's to a team #.
Heck, 80 'best' schedules could probably even be generated by hand...
|
This approach would offer an opportunity for incremental improvement over the existing algorithm, because it is designed to be run in a short amount of time. A set of canned schedules could be prepared using an algorithm with more stringent specifications, regardless of whether it takes hours to run it.