Re: a challenge/problem.

*To*: mathgroup at smc.vnet.net*Subject*: [mg40137] Re: a challenge/problem.*From*: Paul Abbott <paul at physics.uwa.edu.au>*Date*: Sat, 22 Mar 2003 05:08:30 -0500 (EST)*Organization*: The University of Western Australia*References*: <b56hga$bve$1@smc.vnet.net> <b5efij$651$1@smc.vnet.net>*Sender*: owner-wri-mathgroup at wolfram.com

Simon wrote: > I've got a puzzle, im not sure how to solve, a friend of mine asked > me to make a program that given a number of teams (which must be more > than 4 but other than that just dividable by 2) - now, there is > teams\2 matches in a round, and no team must play more than 1 match > in a round (making the number of rounds teams-1). There is a Mathematica Notebook at http://mathworld.wolfram.com/Tournament.html which gives graphical (pun intended) representations of tournaments. Cheers, Paul -- Paul Abbott Phone: +61 8 9380 2734 School of Physics, M013 Fax: +61 8 9380 1014 The University of Western Australia (CRICOS Provider No 00126G) 35 Stirling Highway Crawley WA 6009 mailto:paul at physics.uwa.edu.au AUSTRALIA http://physics.uwa.edu.au/~paul

**Follow-Ups**:**Re: Re: a challenge/problem.***From:*Dr Bob <drbob@bigfoot.com>