473,387 Members | 1,441 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,387 software developers and data experts.

Optimization problem, for a sports tournament

JE
Hi all!

I am working on a C++ program for managing a (real-life) sports
tournament. There are 10 teams involved, which all are to play against
every other team exactly once. Thus, each team plays a total of 9 matches.

The tournament is divided into 3 "rounds", each consisting of 15 matches.
All 10 teams are present at each round, and must play exactly 3 of their 9
matches per round. All 15 matches in a round are to be played at one and
the same field, so only one match can be played at a time.

The problem is to create an efficient playing program for each round, so
that the waiting time between any team's matches will be minimized.


Does anyone have a good algorithm for solving such an optimization problem?

- Joakim

--
jo************@nospam.spray.no

Remove nospam to reply!
Jul 22 '05 #1
2 2565

"JE" <us**@host.com> wrote in message
news:us*******************@129.177.130.126...
Hi all! I am working on a C++ program for managing a (real-life) sports
tournament.
<snip>
The problem is to create an efficient playing program for each round, so that the waiting time between any team's matches will be minimized.


You can convince me this isn't a homework assignment by giving the
name, date and location of the tournament.

Jonathan
Jul 22 '05 #2
JE wrote:

Hi all!

I am working on a C++ program for managing a (real-life) sports
tournament. There are 10 teams involved, which all are to play against
every other team exactly once. Thus, each team plays a total of 9 matches.

The tournament is divided into 3 "rounds", each consisting of 15 matches.
All 10 teams are present at each round, and must play exactly 3 of their 9
matches per round. All 15 matches in a round are to be played at one and
the same field, so only one match can be played at a time.

The problem is to create an efficient playing program for each round, so
that the waiting time between any team's matches will be minimized.

Does anyone have a good algorithm for solving such an optimization problem?


Quick shot: Sounds like a variation of an backtracking problem.
Search the web for 'problem of stable marriage'

--
Karl Heinz Buchegger
kb******@gascad.at
Jul 22 '05 #3

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

2
by: JE | last post by:
Hi all! I am working on a Java program for managing a (real-life) sports tournament. There are 10 teams involved, which all are to play against every other team exactly once. Thus, each team...
0
by: Kewlb | last post by:
Hey, Thanks for your response and yes I know that my code could use a lot o cleaning up. I am mainly a network engineer (CCIE #12284) and onl program as a hobby. The structure of the database...
2
by: Krick | last post by:
I was talking to a co-worker today. He used to work in computers way, way, back in the days when computers had little to no memory, operating systems hadn't been invented yet, and everything was...
2
by: John Ryan | last post by:
I've a small bit of javascript on my site that has a from with 2 selection boxes, when you choose an option in the first box, the second one re-populates its list accordingly. But the second...
16
by: cody | last post by:
I have to write an algorithm with must ensure that objects are put in buckets (which are always 4 in size). The objects have two properties: A and B. It is not allowed that in a bucket are objects...
1
by: urvi | last post by:
Hi... following is a problem i need to solve using divide and conquer method(recursive)..can anybody help me..? You are to organize a tournament involving n teams. Each team must play each...
1
by: noremy | last post by:
Hi! I have one request;) I have searched in google for a tournament tree implementation, but found nothing(really);( Does anyone have any source for a tournament tree? I don't really care what...
1
by: Bryan | last post by:
Well, I've got 2 tables I'm wanting to pull date from sorted by most points asc. Here's the structure... tnumbers table (holds all tournament points: tid, mid, points rollcall table: mid,...
0
by: Charles Arthur | last post by:
How do i turn on java script on a villaon, callus and itel keypad mobile phone
0
by: ryjfgjl | last post by:
If we have dozens or hundreds of excel to import into the database, if we use the excel import function provided by database editors such as navicat, it will be extremely tedious and time-consuming...
0
by: emmanuelkatto | last post by:
Hi All, I am Emmanuel katto from Uganda. I want to ask what challenges you've faced while migrating a website to cloud. Please let me know. Thanks! Emmanuel
0
BarryA
by: BarryA | last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
1
by: Sonnysonu | last post by:
This is the data of csv file 1 2 3 1 2 3 1 2 3 1 2 3 2 3 2 3 3 the lengths should be different i have to store the data by column-wise with in the specific length. suppose the i have to...
0
by: Hystou | last post by:
There are some requirements for setting up RAID: 1. The motherboard and BIOS support RAID configuration. 2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
0
marktang
by: marktang | last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
0
by: Hystou | last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
0
jinu1996
by: jinu1996 | last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.