"March Madness's main tournament starts by pairing off 64 of the highest-level college basketball teams into 32 games. The 32 winning teams move on to the next round, in which they are paired into 16 games. That is followed by eight games, then four, then two and finally one championship game."
"For each of the 63 games, bracket makers have two choices for the winner, resulting in 2^63 possible bracket configurations. That's more than nine quintillion! So it shouldn't come as a surprise that a perfect bracket has never been verifiably achieved."
"Georgia State University mathematician Sam Spiro went in another direction. He asked: Given a collection of brackets scored based on how many games they correctly predicted, can I reconstruct how the tournament actually went?"
March Madness involves 64 college basketball teams competing in 63 games across six rounds, with millions of people filling out brackets predicting each game's winner. With two possible outcomes per game, there are 2^63 possible bracket configurations—over nine quintillion—making perfect brackets virtually impossible. Mathematician Sam Spiro from Georgia State University explored whether tournament results could be reconstructed by analyzing multiple friends' brackets and their scores. This inverse problem asks whether knowing how many games each person predicted correctly reveals which team actually won each matchup, with the answer depending on the number of brackets available and their individual accuracy levels.
Read at www.scientificamerican.com
Unable to calculate read time
Collection
[
|
...
]