To solve this, look at an 8x8 grid representing the games played. The diagonal is not used, because teams do not play themselves. Below the diagonal is the first game between each team and above the diagonal is the second game. Assume that teams 1-4 are the ones who will go to the semi-finals. This means that you only need to assign winners in the first 4 rows and first 4 columns. The lower right of the grid can remain empty. Start by assigning team 1-4 as the winner every time they play teams 5-8. That gives teams 1-4 eight wins each. That leaves just 12 games left to assign in the top left quarter of the grid. It is not hard to assign them so that each time wins 3 of the games, meaning that it takes 11 games to assure a spot in the semi-finals.
Here is a grid of results for one such outcome: X1341111 1X242222 12X33333 423X4444 1234 1234 1234 1234 Don On May 12, 1:44 pm, amit <amitjaspal...@gmail.com> wrote: > Consider a series in which 8 teams are participating. each team plays > twice with all other teams. 4 of them will go to the semi final.How > many matches should a team win, so that it will ensure that it will go > to semi finals.? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
