yego.me
💡 Stop wasting time. Read Youtube instead of watch. Download Chrome Extension

Can you solve the magical maze riddle? - Alex Rosenthal


3m read
·Nov 8, 2024

Today is the annual Sly Wizard Tournament featuring competitors from the wizarding world’s three greatest schools, and you’ve been entrusted with an enormous responsibility. You are to administer the tournament. First, you and you alone will determine how many events there will be and their scoring system. Then the three wizards will enter your maze and compete in your chosen events in utmost secrecy; only you and they will see what happens.

The competition begins and... Wow, that was one for the record books. The winner was... wait, you have no idea. The last thing you remember was a dark wizard showing up and casting a forgetting curse. The competitors seem even more confused— each is convinced they won. This is bad. There can be no do-overs, and the last failure to declare a winner set off the first Great Wizarding War. You’ve got to figure this out— and fast. But for the life of you, you can’t remember a thing.

You know you had to follow a few rules: there had to be three or more events, each with a single winner and loser. Every event used the same scoring system, where first place received more points than second, and second more than third. All points were positive integers. Maybe there’s a record somewhere... oh, of course, your scorecard. Well, that leaves something to be desired. All that you wrote down was that in Calchemy, Newt-niz won, Leib-ton took second, and that was the only time Magnificent Marigold’s Magical Macademy got third all day.

Oh, and some final scores: one school got 22 points, and both of the others got 9. Why are you so bad at taking notes?! No time for self-recrimination. The wizarding world is waiting. Who won the tournament?

Pause here to figure it out yourself.

Answer in 3

Answer in 2

Answer in 1

At first, it may seem like there are an overwhelming number of possible scoring systems, so let's see if we can narrow our options. We can start by looking for clues in the total scores. Every event was scored the same way, so the sum of all points in the entire tournament must be a multiple of one event’s total. In other words, if there were three events that scored 3, 2, 1, which adds up to 6, the total points for the day would be 18, which is three events times 6 points. Our total is 40.

So we can make a table of possibilities: one event totaling 40 points, two totaling 20, four totaling 10, and so on. We know there were at least three events, which eliminates these options, and we can also get rid of events with fewer than 6 points, because the smallest possible total is 3 plus 2 plus 1. That leaves two prospects.

Let’s try to narrow those further by breaking down the possible points earned in each event: if first place received 7 points, the teams that had totals of 9 couldn’t have won an event because their total score would be 10 or more. That means the team with 22 would have to have won all four. But then their total would be 28, so we can eliminate that option. And with four events, these numbers can't be made to add up to 22.

Finally, if first place got 5 points, the highest possible score with four events would be 20, getting rid of these two as well. In fact, five events scoring 4 each could only reach 20 as well. That leaves us with just one possibility: five events each scored 5, 2, 1. There’s exactly one way to make those scores add up to 22: the winner finished first four times and second once.

The scores of 9 mean one team won once and lost four times, and the other lost once and took second four times. That must be Marigold’s Macademy, whose only third place finish was Calchemy based on your note. And Leib-ton’s second place finish in Calchemy means they scored 22 and won the Sly Wizard Tournament.

You have just enough evidence to prove it, keep your job, and avert war. Phew!

More Articles

View All
What is computer science? | Intro to CS - Python | Khan Academy
You’ve probably seen somewhere the definition of computer science as the study of computers, and that probably wasn’t particularly helpful because what does it mean to study a computer? To get to a better definition, it’ll be helpful for us to answer a f…
Photo Walk in Napa Valley | National Geographic
Hi everybody! I’m Ashley Kalina. Thanks for joining us again. We’re here in beautiful Napa Valley for Get Outdoors Day, and we are here with National Geographic and our friends at Nature Valley. I’m joined by Ben Horton, the wonderful photographer. He’s g…
Sal answers questions from attendees at his Schoolhouse.world series
I’d love to answer any questions y’all have about anything. Um, uh, raise your hands or uh, probably raising your hand is the best, is the best way to do it. Yes, Kai, ask your question. All right, thanks. No, thanks again Saul for taking your time and a…
Rick Astley - Never Gonna Give You Up (Official Music Video)
Rick Astley: [Music] We’re no strangers to love, you know the rules and so do I. I full commitments while I’m thinking of you, wouldn’t get this from any other guy. I just want to tell you how I’m feeling; got to make you understand. Never Going To Give Y…
Using explicit formulas of geometric sequences | Mathematics I | High School Math | Khan Academy
The geometric sequence Asobi is defined by the formula, and so they say they tell us that the E term is going to be equal to 3 * -1⁄4 to the IUS 1 power. So, given that, what is a sub5, the fifth term in the sequence? So pause the video and try to figur…
Equations with rational expressions | Mathematics III | High School Math | Khan Academy
So we have a nice little equation here dealing with rational expressions, and I encourage you to pause the video and see if you can figure out what values of x satisfy this equation. All right, let’s work through this together. The first thing I’d like t…