A B C D
1 2 3 4
8 7 6 5
9 10 1 1 12
16 15 14 13
Algorithm.
1) Pick out 1 and 2. ( 1/2)
2) Assign No.3 and No.4 to No.2 from right to left, 1. ( 1/4, 2/3)
3) Assign No.5, No.6, No.7, No.8 to No.4 from left to right. ( 1/5, 4/6, 2/7, 3/8)
4) Assign 9- 16 to 8 from right to left respectively. ( 1/ 16, 5/ 15, 4/ 14, 6/ 13, 2/ 12.
........
The basic idea of the above algorithm is:
Seeds 1 and 2 were selected. In order to prevent them from meeting prematurely, we matched them with No.3 and No.4 players, that is, they were inserted among them, forming a (1/4)(2/3) match. Then, (1/4) was disassembled into a (65438) by selecting No.5 and No.6. ......
Every time a new player is inserted, it adopts a serpentine order, that is, the first time from right to left, and the second time from left to right. ....
After many times of splitting and inserting, the matching table obtained each time is shown in the following triangle:
1/2
1/4,│ 2/3
1/5, 4/6,│ 2/7, 3/8
1/ 16, 5/ 15, 4/ 14, 6/ 13,│ 2/ 12, 7/ 1 1, 3/ 10, 8/9
If there are 32 players, continue to allocate 17 to 1, 18 to 16, 19 to 5,20 to15,2/kloc-0 to 4,22. ...
In this way, the seeds are scattered. The winners of adjacent groups will not meet the seeds prematurely in the knockout stage. In fact, the matching in the above four steps is also the matching form after the seed wins. After all the above algorithms are arranged, four people in adjacent groups can form a group for round robin.