|
||||||||||||
|
||||||||||||
| ||||||||||||
Denise, It sounds like Euler's 36-officer problem: IT CAN'T BE DONE! Label the "6 ranks" by the players of team A (A1 up to A6), and the 6 regiments by the players of team B (B1 to B6). The six columns represent the 6 rounds, and the six rows the 6 games. It's not possible to arrange the 36 pairs A_iB_j so that each A_i and each B_j appears exactly once in each row and each column. (The corresponding Graeco-Latin square can't be devised in the 2 by 2 case, but it's easy for 3 by 3, 4 by 4, 5 by 5, and 7 by 7.) Chris | ||||||||||||
|
||||||||||||
Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences. |