Originally posted by kasperl
if i get this right all you need is a table, with the names of the teams on both axes, and just put dates in the right places. you could probably make something that checks in each cell if on some date either of the affected teams is already playing, and then put in the first possible date. just let that program run and see if it comes up with something usefull.
That's kind of what i am doing... the problem is trying to avoid the linear ( O(n) ) methods for working out what matches are to played, because it would lead to bit of a long running time.... I've been trying to develop a design that will maximise array index references, rather than linear array searches, but it's a pain in the arse.
Although....., thinking about it, that may be a bit more efficient than what i'm doing.....
I think i have a better idea now for what i'm doing, cheers
