Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site tty3b.UUCP Path: utzoo!watmath!clyde!burl!mgnetp!ltuxa!tty3b!arr From: arr@tty3b.UUCP (10-7-83"Andy R. 94130) Newsgroups: net.math,net.wanted,att.wanted Subject: Need help finding algorithm Message-ID: <373@tty3b.UUCP> Date: Sat, 16-Jun-84 00:01:39 EDT Article-I.D.: tty3b.373 Posted: Sat Jun 16 00:01:39 1984 Date-Received: Tue, 5-Jun-84 08:27:49 EDT Organization: Teletype Corp., Skokie, Ill Lines: 30 I hope you don't think my request trivial but here goes. I was asked to create a schedule for opponent play in a league. There were 22 members in the league and they wanted each player to play every other player once, with no player playing more than once a week. That meant that it would be a 21 week schedule with 11 two person games a week. Since I am a programmer at heart I decided to make a "quick" program to print the schedule for "N" players. Well I'm stuck!!! It aint such an easy task. The only way I could get a working program is to make it totally a trial-and-error/iterative type job. This takes a while to run if the "N" is large; especially if I'm using a PC. I am bound-and-determined to find a better way!!! I just can't believe something that is so conceptually simple can be so hard to program. If anyone out there in NETland can help I will be forever grateful!!! If I don't find a solution my wife is going to leave me and I will be sent to a loony bin mumbling..."But there has got to be a better way...." From the ever active terminal of Andy Rolfe ATT Teletype Corp. 312-982-3202 ihnp4!tty3b!arr THANKS IN ADVANCE FOR ANY EFFORTS!!!