- Until 2000, the NCAA men’s Basketball tournament had 64 teams. They played each other in 6 rounds With the winner of each game moving one to play the winner of another game in a pre-specified order. If we assume the initial table of “who plays who” as well as who each winner plays is specified, give a concise description of the state space of all possible out comes. How many elements does the space have ?
- (*) If there are now \(2^n\) competitors and \(n\) rounds, answer the same questions as before.
[ Inspiration [GS2] p 1, # 3]
