MathGroup Archive 2003

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Re: a challenge/problem.

  • To: mathgroup at
  • Subject: [mg40157] Re: [mg40137] Re: a challenge/problem.
  • From: Dr Bob <drbob at>
  • Date: Sun, 23 Mar 2003 04:12:43 -0500 (EST)
  • References: <b56hga$bve$> <b5efij$651$> <>
  • Reply-to: drbob at
  • Sender: owner-wri-mathgroup at


Perhaps I'm missing something, but these graphs seem to contain no 
information about how games are arranged in time.  They merely record the 
results, in terms of who beat whom in each possible pairing.  Nor are 
"score sequences" of any use for laying out a tournament, despite the term 
"sequence" that sometimes indicates ordering or chronology (but not in this 

So... I'm not sure I can agree that these are graphical representations of 

I am in favor of Swiss system tournaments (commonly used in Chess matches), 
rather than the exhaustive (and inefficient) tournaments we're talking 
about here.

Swiss system tournaments match up roughly comparable opponents in each 
round, so that at the end, we don't have controversies about how tough each 
team's schedule was.  The result would be NBA or football playoffs that 
include the best teams.  The down-sides are (1) that the schedule couldn't 
be determined before the season begins, and (2) by mid-season, losers would 
be playing losers, so those games would probably be canceled if ticket 
sales are the goal.

The latter is a down-side only for losing teams, however --- but a big plus 
for fans.


On Sat, 22 Mar 2003 05:08:30 -0500 (EST), Paul Abbott 
<paul at> wrote:

> 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
> which gives graphical (pun intended) representations of tournaments.
> Cheers,
> Paul

majort at
Bobby R. Treat

  • Prev by Date: RE: Q: About Needs[] and something about Contexts
  • Next by Date: RE: The difference between Needs[ ] & Get[ ]
  • Previous by thread: Re: a challenge/problem.
  • Next by thread: Evaluation problem