Round Robin Programming

Hi,

I know I can't be the only game scheduler in the world with this problem...

I need to write a tool that schedules games for x number of weeks with x number of teams that ensures every  team plays each other (if possible).

The basics of the functionality is this:

* There can be an even or odd number of teams, if odd there will of course be a "bye" week where one team is not playing (buy could be considered a team when doing the algorithm).

* The number of weeks can be either even or odd, basically the algorithm should just run until the number of weeks run out even if all teams don't get to play each other.

* The rotation should be so that every team plays every team but never itself (if number of weeks permits)

Basically for 4 teams the result would look like this:

WEEK1:

A vs B
C vs D

WEEK2:

A vs C
B vs D

WEEK3:

A vs D
B vs C

I would like the code to be able to handle the number of games as input, but honestly if the rotation is solved, I can limit the number of games myself.

I do appreciate any help or direction I can get.

Thanks
~j
LVL 2
Who is Participating?

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Commented:
try with this sql, in case of odd number of teams use ? for the last team and make teams even. in the schedule game with team ? means bye.
``````DECLARE @Teams TABLE (teamid varchar(2))
DECLARE @rounds TABLE (roundNum int,teamid1 varchar(2),teamid2 varchar(2))

insert into @Teams
Select 'A'
union all Select 'B'
union all Select 'C'
union all Select 'D'
union all Select 'E'
union all Select '?'

declare @teamCnt int, @round int

select @teamCnt = count(*), @round=0 from @Teams;
while @round<@teamcnt-1
begin
;with team1 as (Select row_number() over(order by teamid)-1 rowNum, teamid from @teams),
team2 as (Select
case when (rowNum + @round)>=@teamcnt then (rowNum + @round) % @teamcnt+1 else
(rowNum + @round) % @teamcnt end rowNum,
teamid from
(Select row_number() over(order by teamid) rowNum, teamid from team1 where rownum<>0 ) A)
insert into @rounds
select distinct @round roundnum,team1.teamid, team2.teamid from
(Select * from team1 where rownum=0 union all
Select * from team2 where rownum< @teamCnt/2 ) as team1
join (Select * from team2 where rownum>= @teamCnt/2 ) team2
on team1.rownum+team2.rownum = @teamCnt-1

select @round=@round+1
end
select * from @rounds
``````
Senior Software EngineerCommented:
Hi,

You are definitely not the only person with this issue.

Check out: http://en.wikipedia.org/wiki/Round-robin_tournament

and read the "Scheduling algorithm" section.

That should give you an idea of how to implement this in code.

Hope this helps,

Darren
Author Commented:
Although this works, it's not really a VB solution...

I'd still prefer if that was a possibility...

~j
Senior Software EngineerCommented:
Hi,

Here's another link that might help.

http://www.vb-helper.com/howto_net_round_robin.html

Cheers,

Darren

Experts Exchange Solution brought to you by

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Commented:
The way I would approach this would be to iterate all the unique two player combinations.  The simplest approach was to create a Players table and the join the table with itself in a query like this:
``````SELECT Players.Player, Players_1.Player
FROM Players, Players AS Players_1
WHERE (((Players.Player)<[Players_1].[player]));
``````

When the Players table contains (ABCD), the result is:
``````Players.Player
Players_1.Player
A	B
A	C
B	C
A	D
B	D
C	D
``````

When the Players table contains (ABCDE?), the result is:
``````Players.Player
Players_1.Player
?	A
A	B
?	B
A	C
B	C
?	C
A	D
B	D
C	D
?	D
A	E
B	E
C	E
D	E
?	E
``````

The code to process this builds the weeks from the query results.  If a player has appeared on the left or right side of a match in a week, they can not be assigned to another match in that same week.
In the following example, the first PvP pair is simply added to the first week.  Since the second pair contains player A, we have to find a week that doesn't already contain player A -- week 2. The third pair contains player B, so we can't add it to the first week and contains player C, so we can't add it to the second week -- week 3.  The fourth pair contains player A, so we can't add it to either of the first two weeks -- week 3.  The fifth pair contains player B, so we can't add it to week 1 -- week 2.  The sixth pair goes into week 1.
Week1: A      B; C       D
Week2: A      C; B       D
Week3: B      C; A       D
Author Commented:
Exactly what I asked for... thanks

~j
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Visual Basic.NET

From novice to tech pro — start learning today.