Representing the states on a cube also describes the puzzle where you need to get 3 animals (e.g. a goat, wolf, and rabbit) to the other side of a river with conditions on which animals can stay on a given side of the river (e.g. the wolf will eat the rabbit) -- you can represent each animal as one of the coordinates, and the solution becomes walking the vertices of the resulting square. IIRC, it is also related to the tower of hanoi, grey code, and serpinski triangle videos 3b1b did a while back.
Standup Maths & 3b1b AND Numberphile all posting videos about error correction and higher dimensional cubes? *Cue the X-Files theme* Parabollati confirmed!
Because it is gerrymandering, just more abstract. I mean, look at the solution with three players. These are all the options for red (R) and blue (B) hats: In BBR, BRB, BRR, RBB, RBR and RRB you have 1 correct, 2 neutral and 0 wrong guesses for each combination. It's like a 67-33 result in the election. In BBB and RRR you have 0 correct, 0 neutral and 3 wrong guesses for each combination. It's like a 0-100 result in the election. If you sum up all the combinations, you'll get 6 correct guesses, 12 neutral guesses and 6 wrong guesses, yet you can win 75% of the games. ... 67-33 and 0-100 results might sound extreme, but now apply them to only 20% of the voters and assume the other 80% of the voters vote evenly for the two parties regardless of gerrymandering. You'll suddenly get six 53-47 districts and two 40-60 districts. These numbers are much more real. (edited due to typos)
The bit strings at the vertices of the cube (or hypercube) are Gray codes, which have the property that only one bit changes between adjacent code words. Since a Gray code of a given length can be ordered, this shows that a Gray code can be used to induce a Hamiltonian path an a hypercube, where in traversing the path, every vertex of the cube is visited exactly once.
Thank you. So nice to see a YooToob thing that is so clean and tidy. Straight to the point, no idiot in a back-to-front hat screaming. "What's up?" at me, no two minutes worth of gabble before that "Let's get to it." Just clean tidy information and enough gentle humour to make it friendly. Thank you very much.
@@Ashbakhaaz I see, because it has to do with coding theory. I just thought they were talking about the other one because it was basically the first problem with the two hats.
I think you can intuitively understand the three player method by considering that everyone getting the same colour hat is unlikely (1/4). Therefore if you make a working strategy for every 'two and one' case you've got a 3/4 winning strategy.
Only a couple minutes in and this seems like something I’ve seen both Matt Parker and James Grime do videos on but with playing cards and a different scenario and an opposite goal. This video obviously goes further than two persons.
I have seen this similar problem on Matt Parker's channel. Really cool maths trick this is. And goes to show how weird and unintuitive such problems can feel, but when dissected make perfect sense.
The population of the planet has yet to exceed 2^32 (about 8 billion) so hasn't met the next breakpoint, so the chance would be about 1/2^31 (about 4 billion).
4 billion and change is a commonly known power of 2, since that's the limit of a 4 byte decimal number. The next time the elegant solution will increase the probability is when the 8,589,934,592nd player joins. Since probabilities only increase slightly between these powers of 2, the probability of winning this game with 7 billion perfect players is somewhere in the 1 over 4 billions.
who is the guy who thought about having mathematicians as RUclipsrs host and making them explain hard math problems and crazy phenomenons This is GENIUS!
For the infinite hats part, I think I found a method that gives *5/8* (62.5%)chance of winning!! I may very well be wrong (and most probably am) but here is my method: Both look for any random row of two Blue hats (it does not have to be strictly two, if there is a row of, say, 5 Blue hats then you pick a pair of any two). Then, they will decide beforehand, and one would choose the top one from his pair and the second would then choose the bottom one from his pair. Now there are 4 cases:- Both of the pairs overlap (25%) •• •• One of them coincides (25%) • •• • One of them coincides, 2nd way (25%) ..mirror of the second case.. DO NOT coincide..(25%) Now the first 2 case will always give the correct match, and the other two each,themselves , have a 25% chance of succes so... (1/4)*1 + (1/4)*1 + (1/4)*(1/4) + (1/4)*(1/4) WHICH gives 62.5% succes rate (I know this is most probably wrong so pls tell where)
This is also a similar kind of idea with many other combinatorics and probability problems. When you only care about maximizing the chance of winning in a game of chance, the optimal strategy is to make it so that when you lose, you lose big but when you win you barely win.
Another strategy for 3 hats with 3/4 success rate is to let A guess anything if the hats of B and C are different and stay silent otherwise. If he stays silent, B knows he has the same hat color as C and can always say the right combination
Have we seen Joe Buhler before? I like him! He's one of those people who looks painfully serious at first glance, but can actually be as goofy as all the others! ❤️
I dunno why, but for some reason this strategy was obvious to me. Just as I saw the 3 hat problem, my first thought was "you have to call the opposite color if you see two hats of the same color and pass otherwise, this way you'll only fail if all three hats are the same color which is like 2 out of 8 chance". Somehow it's the first thing that comes to mind.
I believe I misunderstood the rules but I took it as only one player has to be correct. My first guess would be with Alice Bob and Charles (in that order) have one chose to be a disagreeable party. If, in this situation say to have Charles elect to be an agreeable party. In this case if it is BBR: Lose; BRB: Win; RBB: Win; BBB: Win; BRR: Win; RBR: Win RR,B: Win RRR: Lose. This still has a 3/4 chance of winning the game. Also if all three were a disagreeable party it would be the same BBB: Lose BBR: Win; BRB: Win; RBB: Win; RRR: Lose; RRB: Win; RBR: Win BRR: Win. Same as the end result but still interesting. When looking at 4 players, the optimal path would be for each player, if there is 2 or 3 of the same to choose the opposite. There are 16 possible outcomes but 14 of them would be a 'win' for at least 1 player. The bread down would be (in binary because it is easier) 0000=L 0001=W 0010=W 0011=W 0100=W 0101=W 0110=W 0111=W 1000=W 1001=W 1010=W 1011=W 1100=W 1101=W 1110=W 1111=L. As you can see, only in the end cases do you lose (87.5% win rate).
The 3 hat game, since you are allowed to come up with a strategy beforehand. The ones who see different colors always pass and will go first. Then the last one guesses the opposite color. If no one is passing for 10 seconds (or whatever), they can guess the same color.
About the 2nd game, if all the players could know if others answered already the probability to win would be 100%. You just need to change the strategy by a bit. You say : If no one "pass" that means we all have the same color.
100 people are wearing red or blue hats and placed in a line. Each person can see the hat-colors of the people in front of them in line, but not their own or of the people behind them. Starting from the back, each person guesses their own hat color in turn, loud enough for everyone else to hear. Find a strategy so that at MOST one person guesses incorrectly. With the axiom of choice, the problem can be extended to "there are infinite people, find a strategy so that only finitely-many guess incorrectly".
The three hat problem can be solved every time with two rules. 1/ If you see to hats same colour choose that colour again. 2/ If you see two different colours choose the second one every time, always going clockwise. (Obviously you can see the order of the other two people) Someone is always right.
On one episode of Futurama the characters could switch minds but not back the creators of the show came up with a equation to see how many swaps it'd take to for each character to get back in there original bodies it's called:The Futurama Therom.
On a different note, if you want a perfectly fitting hat, measure your head, and divide the number by pi. That is the measurement of the hat you need for it to perfectly fit on your head.
If you're allowed one wrong everyone else can be correct. The one wrong tells everyone else if there's an even or odd number of a pre decided color of hat then everyone else just counts and if it's not what the wrong said then you know your hat is that color. Bonus the first guy can also be correct 50/50
Another cool hat puzzle, that unfortunately has nothing to do with maths. There are four prisoners. They are standing in a line and between 1 and 2 there is a wall. They all look in the direction of the wall. Each of them gets a hat, that is either red or blue. The prisoners know that there are only two of each color. Everyone can only see the color of the people in front of him, but not his own. The situation looks as follows: 1 2 3 4 r | b r b The one who corectly guesses his own hat color gets his freedom when he loudly shouts out his own hat color. Which one can predict his own color and why? Hint: If the permutation of the hats is different than shown above, the answer might be different.
Here is a fun 75% strategy about carrying a message : The first will pass if he sees two same-color hats. And if he sees two different hats, he'll say a random color (hence the 75% winning) Hearing the choice of the first guy, the second guy can guess his hat right by looking at the third hat and the third simply passes
For the three players hat game if they didn't have to speak at the same time it could always be possible. So if there are 2 red 1 blue both red players instantly pass and the blue knows they are blue. But if they're all the same colour no one will instantly pass so then they should be able to deduce that all are the same colour
For the three hat problem, i think they might be able to get 100 if you are supposed to pass, but are the last one to guess so you guess the same color
Another variation is when there are 100 colors and 100 gnomes, and at least 1 gnome needs to guess his color after seeing each other. Of course, without giving any other information then some kind of strategy.
I don't understand why there isn't a 100% strat for the 3 hat version. Rule 1) if no one has passed and you can see two same coloured hats you pass. Rule 2) if someone has passed you say the hat colour of the other person you can see. What have I missed? Probably something pretty obvious and I'm just having a durp moment, if I'm the only one who's missed it. Edit: the only thing I can think of is the strategy has to work independently of the order guesses are made (although I don't think that is explicitly stated). My strat relies on the one who can see two hats the same colour being able to elect to go first. If participants are not able to set the order in which they answer, the probability for my strat would be *pause for maths* back down to 50%. You could add extra conditions (creating a significantly more complex and less elegant set of rules), but that would still only end up at the stated 75%.
With these descriptions of the rules of the 3 hat game, it seems pretty easy to solve. You can code information into the order of the replies. Let's say that C will be the one to answer and everyone else will pass. Then you can just agree that if A passes and then B passes, that means the hat of C is red. But if B passes and then A, the hat of C is blue. I assume some part of the rules was left out here. Edit: Ok, so everyone is answering at the same time. Right.
Those hats actually look great on him.
You can sense them and guess it's color
∅i
Jjjjjjjj
Daddy
Agreed.
This is actually similar to a card trick Matt Parker and James Grime did some weeks ago
And the Matt Parker/3B1B crossover from yesterday!
@@MrCheeze not really
Just about to comment this
@@MrCheeze It's from the same field of maths as those videos yesterday, but it seems to be the EXACT same maths as the card trick videos.
??
I love that this is such a similar principle to the one in the 3b1b video from yesterday
And Matt and James' anti-psychic video :)
Ikr
Representing the states on a cube also describes the puzzle where you need to get 3 animals (e.g. a goat, wolf, and rabbit) to the other side of a river with conditions on which animals can stay on a given side of the river (e.g. the wolf will eat the rabbit) -- you can represent each animal as one of the coordinates, and the solution becomes walking the vertices of the resulting square. IIRC, it is also related to the tower of hanoi, grey code, and serpinski triangle videos 3b1b did a while back.
Coincidence you think? Maybe there are more people joining in!
Spoilerssss I'm still thinking of a solution to that one
Standup Maths & 3b1b AND Numberphile all posting videos about error correction and higher dimensional cubes?
*Cue the X-Files theme*
Parabollati confirmed!
Also related to prison. They are trying to tell us something.
G 2 0 R 1 4 1 N X S Q U 4 R 1 S
Matt had a vee similar puzzle to the hat problem some time in the last few weeks too.
Coincidence I THINK NOT
4:14 There's another crossover because Alice and Bob are always in 3B1B's videos and now they're here!
"Combining these 50/50s and coming up with certainty certainly sounds impossible."
Nicely put. :-)
@Ron Maimon nevertheless, there is a certain linguistic elegance in the statement quoted above.
false.
I know these videos are edited but Joe Buhler's explanations are so clear it's like I'm watching someone make art in real time. Great video!
0:04 Oh why, why doesn't the cube fall to a square, and the square to a line, and a line to a dot?
Hats off to that professor!
Here..take my like
Clever word play, my friend. I see what you did there. I bestow my like unto you.
*Take it*
bud dum tis
@@omni_nuel_247 LOL!
🥁
charles looks like he was explained the strategy multiple times and he's still confused
and Dave is angry that he always has to pass...
Damn🤣😂👍
Love this guy
Joe’s a top person.
Yeah, I wouldn't mind more of him in the future.
A fair-dinkum bonza bloke.
@@numberphile A top HAT person
Am I the only one who thinks he looks like Chris Hadfield?
12:11 This explanation reminds me of how gerrymandering works.
Because it is gerrymandering, just more abstract. I mean, look at the solution with three players. These are all the options for red (R) and blue (B) hats:
In BBR, BRB, BRR, RBB, RBR and RRB you have 1 correct, 2 neutral and 0 wrong guesses for each combination. It's like a 67-33 result in the election.
In BBB and RRR you have 0 correct, 0 neutral and 3 wrong guesses for each combination. It's like a 0-100 result in the election.
If you sum up all the combinations, you'll get 6 correct guesses, 12 neutral guesses and 6 wrong guesses, yet you can win 75% of the games.
...
67-33 and 0-100 results might sound extreme, but now apply them to only 20% of the voters and assume the other 80% of the voters vote evenly for the two parties regardless of gerrymandering. You'll suddenly get six 53-47 districts and two 40-60 districts. These numbers are much more real.
(edited due to typos)
And as chance would have it, today Tom Scott uploads a video giving a little of the history of how too few people once had too much political power.
The bit strings at the vertices of the cube (or hypercube) are Gray codes, which have the property that only one bit changes between adjacent code words. Since a Gray code of a given length can be ordered, this shows that a Gray code can be used to induce a Hamiltonian path an a hypercube, where in traversing the path, every vertex of the cube is visited exactly once.
Thank you. So nice to see a YooToob thing that is so clean and tidy. Straight to the point, no idiot in a back-to-front hat screaming. "What's up?" at me, no two minutes worth of gabble before that "Let's get to it." Just clean tidy information and enough gentle humour to make it friendly. Thank you very much.
Oh Hey, Stand up Maths and 3 Blue 1 Brown did a collaboration on similar maths to this just recently.
I think you're talking about the one with James Grime and Matt Parker (with the playing cards)
@@WannesMalfait Nope, they're not; they're refering to yesterday's video about the chessboard puzzle
@@Ashbakhaaz I see, because it has to do with coding theory. I just thought they were talking about the other one because it was basically the first problem with the two hats.
Shame about that audio quality!
@@WannesMalfait The trick Matt and James used with the cards video is the same trick used to win the 2 player, 1 must be correct game.
This is the first time I've ever gotten the right answer on these types of problems!! Maybe this show is making me smarter...
Prof. Joe Buhler, The way you are teaching is just perfect. Wish we can raise more educators like you.
I left a comment about it on Matt Parker's video, but this problem is my favourite for about 6 years already! Thank you
I heard this problem in 2008 and it took me until 2019 to solve the 2^n-1 case. One of my favorite problems ever.
I think you can intuitively understand the three player method by considering that everyone getting the same colour hat is unlikely (1/4). Therefore if you make a working strategy for every 'two and one' case you've got a 3/4 winning strategy.
We don't want to step on a landmine... so we predict we aren't on a landmine! I just love how mathematicians think.
"Sir, we're on a minefield!"
"Let's assume that we're not."
Only a couple minutes in and this seems like something I’ve seen both Matt Parker and James Grime do videos on but with playing cards and a different scenario and an opposite goal. This video obviously goes further than two persons.
Hats off to making this video.
Actually, hats on!
I have seen this similar problem on Matt Parker's channel. Really cool maths trick this is. And goes to show how weird and unintuitive such problems can feel, but when dissected make perfect sense.
"If it was the population of the planet the chance would be, I don't know, 4 billion let's say."
This video was recorded in 1974.
The population of the planet has yet to exceed 2^32 (about 8 billion) so hasn't met the next breakpoint, so the chance would be about 1/2^31 (about 4 billion).
4 billion and change is a commonly known power of 2, since that's the limit of a 4 byte decimal number. The next time the elegant solution will increase the probability is when the 8,589,934,592nd player joins. Since probabilities only increase slightly between these powers of 2, the probability of winning this game with 7 billion perfect players is somewhere in the 1 over 4 billions.
@@tristanridley1601 7 billion perfect players...hah
With that many people and such a complicated strategy there's gotta be someone who messes everything up :P
Definitely necessary to say we each have a perfect player robot stand in for us.
This is the kind of video that made me fall in love with Numberphile in the first place.
That was really freaking cool. It's cool to see that these problems have such deep geometric interpretations.
As well as being an interesting problem, the man really does rock that hat!
who is the guy who thought about having mathematicians as RUclipsrs host and making them explain hard math problems and crazy phenomenons
This is GENIUS!
I vaguely remember doing Hamming Codes in college. This was far more entertaining and easy to both understand and remember.
It is just like the cards video James Grime and Matt Parker did.
For the infinite hats part, I think I found a method that gives *5/8* (62.5%)chance of winning!! I may very well be wrong (and most probably am) but here is my method:
Both look for any random row of two Blue hats (it does not have to be strictly two, if there is a row of, say, 5 Blue hats then you pick a pair of any two). Then, they will decide beforehand, and one would choose the top one from his pair and the second would then choose the bottom one from his pair.
Now there are 4 cases:-
Both of the pairs overlap (25%)
••
••
One of them coincides (25%)
•
••
•
One of them coincides, 2nd way (25%)
..mirror of the second case..
DO NOT coincide..(25%)
Now the first 2 case will always give the correct match, and the other two each,themselves , have a 25% chance of succes so...
(1/4)*1 + (1/4)*1 + (1/4)*(1/4) + (1/4)*(1/4)
WHICH gives 62.5% succes rate
(I know this is most probably wrong so pls tell where)
This is also a similar kind of idea with many other combinatorics and probability problems.
When you only care about maximizing the chance of winning in a game of chance, the optimal strategy is to make it so that when you lose, you lose big but when you win you barely win.
2^6 likes and 2^0 dislikes. This is amazing.
Now show that exactly one of these tends to infinity :)
@@renerpho
Neither does.
@@rogerkearns8094 The no. of likes tends to infinity :)
who was the one dislike ;(
One person guesses the same, one person guesses opposite. Matt Parker and James Grime did that trick with cards.
Would be interesting to see the implementation of the problem too. I imagine it's got to do with networking and packet errors
Another strategy for 3 hats with 3/4 success rate is to let A guess anything if the hats of B and C are different and stay silent otherwise. If he stays silent, B knows he has the same hat color as C and can always say the right combination
they all have to guess at the same time.
A guy in my math class asked this question once :D
Have we seen Joe Buhler before? I like him! He's one of those people who looks painfully serious at first glance, but can actually be as goofy as all the others! ❤️
I liked him a lot when he was my instructor & advisor at Reed College (1987-1990). I think he was also one of many math professors who juggled.
Your channel definitely deserves my subs!
Couldn’t stop thinking of the song “More Than One Hat” by Curtis Plum.
I love this channel so much! Never stop being amazing!
I dunno why, but for some reason this strategy was obvious to me. Just as I saw the 3 hat problem, my first thought was "you have to call the opposite color if you see two hats of the same color and pass otherwise, this way you'll only fail if all three hats are the same color which is like 2 out of 8 chance". Somehow it's the first thing that comes to mind.
This was so nice to watch, would love to see more videos with Mr. Buhler :)
So we can have a nice game when the world population hits 8.589.934.591 (2^33 - 1). Start preparing, everyone!
prepare for the game or procreate as to hit that world population number in my lifetime?
@@casfighter34 We're forecast to hit that figure in about 10 years.
@@Sakkura1 start figuring out the strategy to maximize our success....
I believe I misunderstood the rules but I took it as only one player has to be correct. My first guess would be with Alice Bob and Charles (in that order) have one chose to be a disagreeable party. If, in this situation say to have Charles elect to be an agreeable party. In this case if it is BBR: Lose; BRB: Win; RBB: Win; BBB: Win; BRR: Win; RBR: Win RR,B: Win RRR: Lose. This still has a 3/4 chance of winning the game. Also if all three were a disagreeable party it would be the same BBB: Lose BBR: Win; BRB: Win; RBB: Win; RRR: Lose; RRB: Win; RBR: Win BRR: Win. Same as the end result but still interesting. When looking at 4 players, the optimal path would be for each player, if there is 2 or 3 of the same to choose the opposite. There are 16 possible outcomes but 14 of them would be a 'win' for at least 1 player. The bread down would be (in binary because it is easier) 0000=L 0001=W 0010=W 0011=W 0100=W 0101=W 0110=W 0111=W 1000=W 1001=W 1010=W 1011=W 1100=W 1101=W 1110=W 1111=L. As you can see, only in the end cases do you lose (87.5% win rate).
WHAT AN EDUCATIONAL VIDEO , WE MUST KEEP OUR PRIORITIES
"An unsophisticated forecaster uses statistics as a drunken man uses lamp-posts - for support rather than for illumination. "
--After Andrew Lang
Ha that's great!
I suddenly have a desire to rewatch "Cube" (1997). That 4D cube and "...n=2-1.." is tickling some brain cells.
Vital to these scenarios is that the people can communicate before-hand.
The 3 hat game, since you are allowed to come up with a strategy beforehand. The ones who see different colors always pass and will go first. Then the last one guesses the opposite color. If no one is passing for 10 seconds (or whatever), they can guess the same color.
This video reminded me of gerrymandering. Especially with the hats being red and blue.
cant imagine the expenses for these fency hats. :O they do everything to bring us the quality content we need
About the 2nd game, if all the players could know if others answered already the probability to win would be 100%.
You just need to change the strategy by a bit. You say : If no one "pass" that means we all have the same color.
Parker and Grime recently did something about guessing each other's cards where one of them is always right and one of them is always wrong.
Love this stuff! Seems almost exactly like the game "Hanabi"
100 people are wearing red or blue hats and placed in a line. Each person can see the hat-colors of the people in front of them in line, but not their own or of the people behind them. Starting from the back, each person guesses their own hat color in turn, loud enough for everyone else to hear. Find a strategy so that at MOST one person guesses incorrectly.
With the axiom of choice, the problem can be extended to "there are infinite people, find a strategy so that only finitely-many guess incorrectly".
With the 3 hat problem, Bob should immediately know he has a blue hat once Alice says red and Charlie has a blue hat. You always win.
They all guess simultaneously.
Something we never ask, but something we need in the current quarantine.
Glad to see Paul Newman took up teaching.
The three hat problem can be solved every time with two rules. 1/ If you see to hats same colour choose that colour again. 2/ If you see two different colours choose the second one every time, always going clockwise. (Obviously you can see the order of the other two people) Someone is always right.
All of the guesses have to be right in the 3 hat problem.
I'd love to see a Numberphile video on 100 Prisoners and a Light Bulb.
Numberphile, 3Blue1Brow, and StandUpMaths all make videos regarding prisoner problems and colorful cubes.
I am a simple man. I see Numberphile video, I like it.
On one episode of Futurama the characters could switch minds but not back the creators of the show came up with a equation to see how many swaps it'd take to for each character to get back in there original bodies it's called:The Futurama Therom.
This ties in well with 3b1b's most recent video and his collab with standup maths!
as a comp sci major familiar with error detection/correction algorithms in interesting to see another way of view the underlying math.
I'm a couple of days late on this but I've just heard of the passing of Ron Graham, of Graham's Number fame. RIP.
similar to that card puzzle with matt parker and that other guy
43 comments when the video hasn't even been posted long enough to view it in its entirety, goodness
On a different note, if you want a perfectly fitting hat, measure your head, and divide the number by pi. That is the measurement of the hat you need for it to perfectly fit on your head.
Yeah, but too much pi and your trousers won't fit.
If you're allowed one wrong everyone else can be correct. The one wrong tells everyone else if there's an even or odd number of a pre decided color of hat then everyone else just counts and if it's not what the wrong said then you know your hat is that color. Bonus the first guy can also be correct 50/50
Another cool hat puzzle, that unfortunately has nothing to do with maths.
There are four prisoners. They are standing in a line and between 1 and 2 there is a wall. They all look in the direction of the wall. Each of them gets a hat, that is either red or blue. The prisoners know that there are only two of each color. Everyone can only see the color of the people in front of him, but not his own. The situation looks as follows:
1 2 3 4
r | b r b
The one who corectly guesses his own hat color gets his freedom when he loudly shouts out his own hat color.
Which one can predict his own color and why?
Hint: If the permutation of the hats is different than shown above, the answer might be different.
I love this videos so much!
I was proud of my self for figuring this out lol and then so many hats
this guy has been on YT for 8 years and is still active..
That is not uncommon.
Wise Guy it is for someone that consistently uploads
Seems to be the week for puzzles involving coloring cubes and binary! (See the recent Matt Parker / Grant Sanderson collab.)
Hmmm... this is suspiciously related to the 3b1b and stand up maths videos that just came out.
Here is a fun 75% strategy about carrying a message :
The first will pass if he sees two same-color hats. And if he sees two different hats, he'll say a random color (hence the 75% winning)
Hearing the choice of the first guy, the second guy can guess his hat right by looking at the third hat
and the third simply passes
those drawn hats are damn lit
Excellent video! Joe is great at explaining this!
You know you are lucky if Numberphile and 3blue1brown post new videos in a span of two days😉
#mathslove
Nice work!
Hats off to you Sir!
This one looks so real! Good job!
I read about Hamming codes just yesterday
Nobody:
Numberphile: Hat Problems
So great to see Walter White in a red hat
ah yes the worlds first prison escape themed hat simulator
9:32 How can you even draw a cube like that....
I draw it with two overlapping squares😄
@@fakexzvo9479 you can draw with a hexagon and a Y inside.
What do you mean?
@@NoriMori1992
/ \ / \
| | -> | \ / |
\ / \ | /
ah... sorry, i think you were talking to FakeXZVO
@@marcoskunrath5914 Yes, I was. And I still don't know what they mean XD
This problem is shockingly similar to the one from 3b1b yesterday
for once i got it without guessing! i guess all those game theroy and maths classes paid off after all
For the three players hat game if they didn't have to speak at the same time it could always be possible. So if there are 2 red 1 blue both red players instantly pass and the blue knows they are blue. But if they're all the same colour no one will instantly pass so then they should be able to deduce that all are the same colour
For the three hat problem, i think they might be able to get 100 if you are supposed to pass, but are the last one to guess so you guess the same color
Another variation is when there are 100 colors and 100 gnomes, and at least 1 gnome needs to guess his color after seeing each other. Of course, without giving any other information then some kind of strategy.
Its pretty awesome how well he pulls off those ridiculous hats.
I got the three hat strategy before it was said!
How many here, I forget anything and everything said in this video...
I need to watch this for 3moretimes I think
Ohh boy, this reminds me of probability which I took in college( PTSD)
I don't understand why there isn't a 100% strat for the 3 hat version.
Rule 1) if no one has passed and you can see two same coloured hats you pass.
Rule 2) if someone has passed you say the hat colour of the other person you can see.
What have I missed? Probably something pretty obvious and I'm just having a durp moment, if I'm the only one who's missed it.
Edit: the only thing I can think of is the strategy has to work independently of the order guesses are made (although I don't think that is explicitly stated). My strat relies on the one who can see two hats the same colour being able to elect to go first. If participants are not able to set the order in which they answer, the probability for my strat would be *pause for maths* back down to 50%. You could add extra conditions (creating a significantly more complex and less elegant set of rules), but that would still only end up at the stated 75%.
With these descriptions of the rules of the 3 hat game, it seems pretty easy to solve. You can code information into the order of the replies. Let's say that C will be the one to answer and everyone else will pass. Then you can just agree that if A passes and then B passes, that means the hat of C is red. But if B passes and then A, the hat of C is blue. I assume some part of the rules was left out here.
Edit: Ok, so everyone is answering at the same time. Right.