Xref: utzoo alt.sources.wanted:631 comp.sources.wanted:13745 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!uakari.primate.wisc.edu!dali.cs.montana.edu!rpi!masscomp!mod From: mod@masscomp.ccur.com (2915) Newsgroups: alt.sources.wanted,comp.sources.wanted Subject: Round Robin Tournament playoff scheduler wanted Message-ID: <61316@masscomp.ccur.com> Date: 23 Oct 90 21:05:37 GMT Followup-To: alt.sources.wanted Distribution: na Organization: Concurrent Computer Corp. - Westford, Ma Lines: 67 Given a list of the names of the players in a tournament (such as golf or chess) I'd like sources to a program which calculates the number of rounds required and the pairs of players scheduled to play during each round. CONDITIONS: - Every player must play every other player exactly once. - Every player must have an opponent during every round. A "phantom" player may be created in case there is an odd number of players, and the phantom is scheduled during every round just like any other player. Of course, the "real" player paired with the phantom during any particular round is actually idle during that round. The "real" player would probably win that round... So, if the program were called "roundRobin" and you had the names of the players in the file "playerList" you'd say something like: # cat playerList Moe Larry Curly Agnes Velma Gertrude # roundRobin