摘要
对n支球队单循环比赛的赛程问题 ,在使赛程对各支球队来说尽可能公平的条件下 ,给出一了个赛程编排算法 .该算法可以给出各支球队每两场比赛相隔场数的最小值的上限值为 [(n- 3) 2 ].利用这个算法 ,我们给出了n=9时各支球队每两场比赛相隔场数的最小值达到上限 3的具体赛程编排 .最后 ,我们讨论了衡量一个赛程优劣的另外一些指标 .
As far as the arrangement of the games of several teams in single robin is concerned,it is given a algorithm of the arrangement so that the games are as equal as possible. According to this algorithm,we can calculate the upper limit of minimum of every two games apart.
出处
《南华大学学报(理工版)》
2003年第2期24-26,31,共4页
Journal of Nanhua University(Science & Engineering)