The code names of the seven teams will be determined by drawing lots as A, B, C, D, E, E and G. The competition will be divided into seven rounds, with three games in each round. Just follow the following arrangements (all teams can play for one day and have a rest).
The first, second and third group matches are over.
A-B company
Two F A-C B-E D-G
Sandong A-D B-C F-G
D A-E B-F C-G
Five C A-F B-G D-E
Six letters
Seven A B-D C-F E-G
ezio 393 20 14- 10- 18
Q:
Is it all a day off?
Answer:
You can play one round a day. If you have a loose schedule, you can take a day off, which takes 13 days. If time is tight, you can also arrange two or three days off. If you need further arrangements, please tell me your thoughts and requirements (the start and end date of the competition, the number of venues, the number of games arranged every day, the start and end time of the competition every day, etc.). ), and I can give you detailed answers.
This topic is a practical problem of single-cycle schedule arrangement in ball games. When there are n teams competing, the schedule should be compiled with fairness in mind, and the "upper limit" value should be calculated to evaluate the advantages and disadvantages of the schedule. Among them, the "upper limit" in question 2 should be understood as the maximum number of intervals between two games of each team when the intervals are as equal as possible (that is, the schedule is fair).
Second, the model hypothesis.
1. Set up n teams for single round robin, with team codes of A, B and C. ...
2. Every game is played in the same venue, and the venue is not empty.
The number of matches between each team is as equal as possible.
4. In all the games of team N, the maximum number of games that can be divided between every two games of each team is called the upper limit, which is recorded as M(n).
Regardless of other factors, the game can always be played normally.
Thirdly, the establishment and solution of the model
There are n teams 1, 2, 3, ... n, so the fairness of the schedule should be considered when arranging the schedule, which mainly depends on the equality of rest time between every two games. When arranging the schedule, the number of games between every two games reaches the upper limit, so as to ensure the fairness of each team.
1. Question 1)
For five teams, we regard these five teams as the vertices of a pentagon and convert them into a plane network diagram for analysis. In order to consider fairness, the number of matches between teams should be at least 1. As shown in the following figure (1):
A
Eurobank
Washington D.C.
Figure (1)
In this way, the schedule can be arranged clockwise from team B as follows: game 1: B-C, game 2: D-E, game 3: A-B, game 4: C-D, game 5: A-E, game 6: B-D, game 7: C-E, game 8: A-D and game 9.
Number of games between every two games
An X 3 10 8 5 1, 2 1
B 3 X 1 6 9 1，2，2
C 10 1 X 4 7 2，2，2
1， 1， 1
E 5 9 7 2 X 2, 1, 1 round robin points, each pair of two games, the points are the same, depending on the winning or losing relationship, the endless cycle is smaller than the small points, and the net win points.
The least number of games is the knockout.
19 team elimination arrangement,
The first round: 13 teams bye-bye, 6 teams participate, 3 games.
The second round: the first round of bye 13 teams+the first round of winning 3 teams, 8 games.
The quarter-finals: 8 teams won in the second round, with 4 matches.
Semi-final: the quarter-final won, 4 teams participated and 2 games were played.
Final: Team 2 won the semi-final with a score of 1.
A total of 18 games.