For my sins, I'm about to take over as secretary of a local pool league
Part of the responsibilities include generating league schedules.
A standard algorithm is used - best explained here.
Each team plays each other twice, once at home, and once away.
But there's a small problem with it, and my brain hurts, so I wondered if anyone has any input...
Some venues have two teams but only one pool table. In these instances, one team must play away, and one team must play at home each week.
My (so far unprogrammed :) solution involves the following:
Now comes the bit where my brain wobbles a little.
If we could assume that no more than 1/3 of all teams will have the issue of both teams not being able to play at home at the same time, is there a general algorithm we could apply to the final schedules to rejig games to ensure no problems occur?
My initial thought was to run through the schedule for each team once. If a 'double home' was found, reverse the playing of that game and switch the game in the second half as well to balance out. Of course, that could create a problem elsewhere, so on its own is probably not ideal.
argghhh, no, fried again. Sometimes when writing a question here I get the answer sorted before I finish typing. This time I just want to lie down and put a paper bag over my head.
thoughts?
cLive ;-)
--
seek(JOB,$$LA,0);
In reply to league games schedule algorithm by cLive ;-)
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |