A few years ago Warren Buffett started offering $1 billion to anyone who could correctly predict the winner of every game in the NCAA men's basketball tournament. A 64 team (we won't count the first four play-in games) single-elimination tournament bracket like "March Madness" has 2^63 possible bracket combination, putting the odds of correctly predicting a perfect bracket around 1 in 92 quadrillion.
But what if I don't want to leave this up to chance or skill? If I wanted to submit all 2^63 possible brackets to ensure that I submitted a winner, how improbable is this? I see two limiting factors - computational time and storage space, although I might argue that this is possible.
My question is two-fold:
Given current computing limitations, how long would it take to compute all possible brackets? Particularly, how long would it take to compute one bracket, and how quickly could the fastest computer compute them all?
How much space would storing these brackets take, and is it a feasible amount of storage?
For 2, my guess is that it's a lot of data, but it's feasible. A bracket can be represented by 63 bits, each bit representing a game in the tournament and the 1 or 0 signifying whether the high or low seed won. Thus we have 2^63 brackets, each at 7.875 bytes each, for a total of roughly 72.6 exabytes of data. Given that Google is estimated to have between 10-15 exabytes of data, this is an absurd amount of data but not out of the realm of storage possibility.