Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site decwrl.UUCP Path: utzoo!watmath!clyde!burl!hou3c!hocda!houxm!houxz!vax135!floyd!harpo!decvax!decwrl!dec-rhea!dec-turtle!bennison From: bennison@turtle.DEC Newsgroups: net.wanted,net.math Subject: Re: Algorithm for scheduling tennis matches Message-ID: <1062@decwrl.UUCP> Date: Mon, 4-Jun-84 11:49:04 EDT Article-I.D.: decwrl.1062 Posted: Mon Jun 4 11:49:04 1984 Date-Received: Wed, 6-Jun-84 05:23:49 EDT Organization: DEC Engineering Network Lines: 15 ----- One solution to the problem that I get by fooling around with matrices for a few minutes is this: assume we have n players, with n even. let d(i,j) be the day that the ith and jth players play. then d(i,j) = (i + j - 1) mod n-1 for i < j < n and d(i,n) = (2i - 1) mod n-1 for i < n Vick Bennison ...decvax!decwrl!rhea!turtle!bennison (603) 881-2156