You are given 4N doubles tennis players for some N>0. Say they are numbered 1,2,...,4N. A game of doubles is a 2-set of two 2-sets. {{A,B},{C,D}}, where A thru D are distinct players. Here the team of players A and B plays against the team of C and D. Your algorithm must print 4N-1 games that meet the following constraints: 1. Each player plays exactly two games against each other player. 2. Each player has each other player as a teammate exactly once.
For example, if N=1, we'd have the 3 games {{1,2},{3,4}} {{1,3},{2,4}} {{1,4},{2,3}} -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.