Challenge #307: Round-robin

[Kenda]

A solution to last week’s challenge can be found here.

You and your friends have decided to start your own tennis league. Your friends know you are good with data and have put you in charge of creating the schedule for the season.

At this point, you don’t know how many teams will be joining the league or how long the season will last. You decide to create an app that has two inputs: the number of teams participating and the number of weeks for the season. The app will then create a round robin schedule where each team will be matched up with each other team an equal number of times (unless the inputs require bye weeks).

The "Output Sample" shows what your output data rows will look like if you have 5 teams and 5 weeks for example.

[joelmiller66]

Spoiler

[balajilolla1]

Spoiler

Solution Attached

[TonyA]

Here's my solution.

Spoiler

The round robin pattern in the solution had Team A starting with 1 one in the first match and other matches in the week with 2, 3, 4 etc. The second week starting with team 2 and so on,  wrapping back to 1 after the max team. Team B started with the highest number team the first week in the first match and counting down for the successive matches in that week, wrapping back to the max team number after 1. Then started the second week with Max - 1 and so on. Turns out this does give a balanced number of matches for each pair of teams and the same number of games for every team assuming the number of weeks is a multiple of the number of teams. If not some of the teams might get one more game than others.

[RolandSchubert]

Spoiler

Spoiler

Great challenge! Used an iterative macro to create the the schedule.

[Hilda]

My Solution.

Spoiler

[Qiu]

Hope I get it right.

Spoiler

[AkimasaKajitani]

My solution.

Spoiler

I was not sure how to handle the number of the season. So, I make the Round Robin schedule then I update the Weeks by considering the number of the season.

[patrick_digan]

Fun! Just another challenge that I found a way to overcomplicate...

Spoiler

I wanted to first find all the possible matchups (ie team 1 vs team 2, team 1 vs team 3 etc.) for each week (ie 1-2 and 3-4 could be week 1's matchups). Then I basically cartesian joined that for the number of weeks that are played. This is a really big dataset with all possible matchups. I then found the average number of distinct matchups and picked the first one. It took 2 iterative macros and way too many tools, but this is how my brain was able to think through it.

[Nelson_D]

Hi All,

Attached is my solution.

Spoiler

Spoiler 

Thanks

D Nelson