Team Planning Algorithm - Quiz Design

Question

I have a strange problem to solve - this should be used when developing a quiz, but the easiest way to explain the use of commands.

There are 16 teams and 24 matches. In each match 4 teams play. Each team should appear once against 12/16 teams and twice against the remaining 3/16, and should appear exactly 6 times. Any ideas how to do this? If there is software that can do this, that's great too.

UPDATE: I'm not sure if this is possible. Here is the minimum we are trying to accomplish:

• The number of games is not installed.
• Each game has 4 teams.
• Each team receives an equal number of games.

Is it possible?

Answer 1

Please note that each team plays 3 others per match, so at least 5 matches are required for all 15 other teams. Therefore, we hope that there is a solution for 20 matches, where each team plays 5 matches and plays each team exactly once.

With 16 teams, you can build a solution manually as follows:

• Divide 20 matches into 5 rounds
  • Enter commands 1-16.
  • For each match, in turn, for each of the 4 places in this match, highlight the first team that
  • still playable in this round
  • have not played any of the teams already allocated for this match

, , , n , n .

24 , , . , , . , {1,2,3,4} {5,6,7,8} - , 6 {1,2,7,8} {3,4, 5,6}. 1 2 1-5, {1,2,3,4}, , , {1,2,7,8}.

, .

Answer 2

... http://en.wikipedia.org/wiki/Round-robin_tournament

, - , ...

, , ... ... http://en.wikipedia.org/wiki/Tournament_(graph_theory)

Answer 3

. , .

Answer 4

"Combinatorial Designs and Tournaments" - , , ​​. " " , .

Answer 5

. . , 16 , , ( A & B C & D). E thru P. , ? , . , , .