3rd one is formulated really Bad. The prisoner who can look in all boxes is he one of the 100 prisoners? So only 99 should know the number of the Box with their name in it. because the prisoner who can look in all boxes has a 100% Chance
Why not: • Every prisoner gets his number • First prisoner swaps names that Prisoner 2 gets his name in box 2. Prisoner 3 gets his name in box 3 100% wins
I confirm the solution is perfectly viable. The ones who disagree simply have to reflect on the riddle a bit more and understand it. The most frequent argument is that even if the first prisoner will guarantee there's no loop of more than 50 names, it's not guaranteed each and every prisoner will pick the loop with his name in it, thus finding it. This argument is fully invalid, as it is guaranteed he will pick the right loop simply because the box with his name always leads to the box of his number (thus they're in the same loop) and every prisoner starts looking into the box of his number.
There is the thing. if the first is in a smaller loop, that is inproblable, all die. there is no chance of full success. It can be a chance of all go througt or all die. Even if the first on identify that there is a loop bigger than 50. He is alredy dead. Becouse he doesn't know wich box replace.
I don't agree with your solution to #3. Yes, the first prisoner can ensure that no loop exceeds fifty boxes. So there will be two or more loops. That doesn't guarantee that any prisoner will find his own name. To do that he'd have to work the correct loop, and he has no hint on where to find it.
I agree with you... I think the person posting the riddles is suffering from brain scramble on #3... I started reading through the comments to see if someone agreed with me ... If we give this thread a thumbs up, others will find it faster ...
The prisoner will always be in their own loop. It is necessarily true that their start box and name box must be in the same loop, since their name box is the one that comes before their start box (thus forming the loop)
No light in their room, no job, getting up late for an interview, not having their clothes already laid out. If a person can't get their stuff together that would be their best option.
Riddle 3- Easiest way As 1st person can change any box and can look them He will plan with other mates that he will arrange everyone name from 1-100 acc to alphabet sequence (like dictionary). As everyone know there name they will able to know the box Number with there name as already discussed with eachother . Quite easy
Killua Zoldyck and if you want to nit pick about capitalisation, I'll nit pick about your lack of punctuation. Shouldn't it be: You didn't need to capitalise " the "?
6:15 "If there's a loop that is over 50 steps long, there can only be 1" I don't understand. A loop can even be 99 steps long, say if each box contained the name of prisoner "n+1." If we are to proceed with the strategy, many prisoners will miss their names because the can only open until the 50th box. In fact, I believe almost all of them will miss their names. EDIT: Figured out how to close 100 step loop into 2 loops: The 100th box is supposed to contain what should be in the 1st box. Just switch the contents of the 100th box and the 50th box.
first 2 are too ez, but the third, iyes they are smart, but they're not good memorizers, so they cant memorize the names, cant the first one just walk in and align the names in alphabatical order and then let the prisoners go in, in alphabatical order too?
mR Dub and Paul Smith , no there arent 100 letters in the laphabet, but if 2 ppl have the same letter, then u order them according to their seccond letter's alphabetical order, and in case the second is also the same, u do the same process with the third letter, and so on. example: if there are 3 people names: nelson, nijel, jeffery first is jeffery then is nelson, because letter (e) comes before the letter (i) in the alphabets and last is nijel
Tabirca Radu ah ok, makes sense, can u explain the solution though? i dont see how doing what he explained garuantees in all of them finding there names.
Dude I have found another strategy... When they discuss the strategy they tell the first prisoner that is aloud to switch all boxes as he wants to put every prisoners name in alphabetic order....the alphabet is like 21 letters long sooo every prisoner can open 50 boxes and the possibility to find his name is tooo high
Riddle 3: Another way to solve it that makes it easier for every prisoner except the first one: The first prisoner memorizes the order of the prisoners entering, and each prisoner memorizes their own number. The first prisoner puts the second person's name in the second box, third in the third box, etc. The prisoners open their own box and immediately leave.
With the third, why can't the first prisoner check who's next, find their name and swap it with box 2? Dunno id i'm missing something but it says he can check in all of them and swap two around, this should work. (Hopefully)
only 1 prisoner can look in all 100 boxes and cqn only switch 2 names. the rest can only open 50 boxes and have to leave the boxes exactly how they were.
or since they numbered and he/ she memorized numbers with names. he would just put them into numbers... idk if ui make sense, but you are allowed to switch as many times
About that last one riddle - there is one much better solution. Everything starts with mutual agreement, a week before the game. Every prisoner will have his unique number. For example - prisoner John Smith will have the number "6". When the game begins, some prisoner goes to the boxes, opens them all and finds the name "John Smith". After that, it's enough to knock on the lid of that box for six times. His friend John Smith will understand that in exactly THIS box is his name. This ''knock-guy'' prisoner will knock on the other boxes in this way, sending the relevant signals to other prisoners each according to the number of knocks. In this way, everyone will know where to go and which box to open because everyone has his own unique number that is the same as the number of knocks, and that ''knock-guy'' knows them. And even if the prisoners were wrong to see it, just go to the area where it was knocked - each of them has 50 attemps.
1) Alternative: Black socks are pretty much thicker than most white socks, let alone how she should at least identify which is lighter and darker. 2) The guy in the mid. 3) If the first pri. Can arrange it, they should just arrange it chonologically, different from yours though..
In riddle 3: In the explanation or solution there was no hint that the first prisoner has a limit of swapping names. So it could be very simple to solve just by swapping the names of the prisoners until they are in the same order as the order they enter. This way only the first prisoner would open all the boxes reorder the names in them and than all of the other prisoners would solve the riddle by opening only the box corresponding to their order number. They could even order themselves alphabetically so that the first prisoner doesn't even need to remember their names, but only order the names in the boxes alphabetically. The other prisoners would not be required to remember anything else than their number in the order.
I thought the prisoners had planned their order so couldn't the first person change the boxes by order, so third person would pick box three? I probably am missing something and sound really dumb
the last riddle is stupid.. lol are there cameras or something.. is there no rule in changing the boxes themselves... lol if not.. the first guy should be someone who knows everyone's name.. and put the boxes themselves in the order the prisoners came up with.. id say best to put them in alphebitcal order lol... the numbers are irrelevant here.. just like they were in the sock riddle... lol how are the numbers on the boxes.. can't you just swap the numbers and organize the boxes in alphabetical order.. so the prisoners are guaranteed to know it's their box no matter what lol... haha all this lies on number one prisoner lol he can't mess this up or everyone is executed
one prisoner writes the 100 names on 100pieces of paper and give each other a paper with is name. they each chose a number from 1 to 100. Prisoner k removes and eat the original paper from box k and replaces it with the paper with his name written on.
+Sweet Niya, He said you can't communicate in cells, however the warden gave them some time (Break actually to make a Strategy ) Which they did , i mean you can't like a prisoner go to pick his number (Name then come back and tell the next cell "Hey.. i got no.1 , try picking the other one" That what he meant
I don't know if it wasn't communicated well or what, but even if someone can swap 2 names at he very beginning, there's still the chance for failure. There are effectively 99 boxes and 99 people each only only get 50 tries at once, since only the first person can swap names & look at all boxes. All it takes is for 1 person not finding their own name. Maybe I'm just misunderstanding the solution or something
I have better solution for this riddle first one can arrange it in the form of alphibitic form souppose, if someone name starts with A he should numbered at starting few boxes and next B and so on. by this others 99 can open 50 boxes in which they can open according to their first alphabet so by this they don't need 50 boxes to open they can easily find by just 25
You don't know how to tell these riddles my friend. No disrespect to you, I swear I don't mean any disrespect but I've heard them before and you're not doing a good job saying them. People can get confused because you can not articulate the riddles correctly.
JIGYASA SETHI WTF IS WRONG WITH YOU? Get tf out of here, if this guy is a UA-camr and is trying to entertain people he should be prepared for criticism. Go hide in ur safe space you snowflake
You really did not get that one didn't you? That's not how it works. Since there are only two colors and if you get two socks that are diff colors then the possibility of getting the same color of either one of the previous two socks is 100% since you used up the 1/2 probability. You're using a paradox to the riddle saying that you can get three of the same color when in the riddle it starts off of grabbing only *two* socks.....and by obvious means, if the two socks are both the same color then what is the point of getting a third sock in the first place-disregarding if it might be the same color or not.
IEatWhenI'mBored it still doesn't matter like explained before as long as you grab 3 socks your good 1. If you grab white then white your already good 2. If you grave black then black your already good 3. If you grave black then white or white then black guess what when you grave the third it has to be either white or black now you have a pair for sure hence why yo u wanna just grave 3 it's a paradox by grabbing 3 your 100% to have a pair in your hand with the info the riddle gives us we are assuming she's grabbing these socks n putting them on in car where she can see but she wants to be sure when she make it to where ever she can see she want to have a pair
Riddle 3: If prisoner 1 is allowed to open up all the boxes and change the names the way he wants, why doesn't he just rearrange them in an alphabetical order (family name)? The day before, they line up alphabetically and see e.g. "Krustchow is number 11" etc. If the first prisoner then rearranges the cards, every prisone besides the first one has to open only one box. I foresaw your solution, but the problem is, you cannot learn 99 names in one night. More importantly, 100 prisoners will unlikely know each 99 prisoner in just one night. One might fail to remember a name which will result in failure for the team. Go on, rant on me for being so picky. It will work either by remembering the names or by rearranging the cards alphabetically.
The first prisoner can't switch more than two names from the boxes, but there is no rule preventing him from rearranging the boxes themselves. He can just put the boxes in the order the prisoners come in starting from the box containing the name of the first prisoner and they will all just need to open one box to find their names. Think outside the box, lol.
He can't just swap any two name in a loop to cut it in half ... if you swap two success numbers you merely reduce the loop by one. Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 4) -> Box 4 (Name 10) -> Box 10 (Name 1) If you swap The Name in Box 8 with Box 72 ... you get a single loop Box 72. But the loop goes Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 4) -> Box 4 (Name 10) -> Box 10 (Name 1) Now if you swap Box 3 with Box 4 Box 1 (Name 3) -> Box 3 (Name 10) -> Box 10 (Name 1) And Box 4 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 4) Or if you swap Box 72 with Box 10 Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 1) And Box 4 (Name 10) -> Box 10 (Name 4) So the idea just swapping two names in the sequence will "cut the loop in half" is wrong.
Isn't there another solution for the 3rd problem using the time each prisoner spends in the room with the boxes? So the first one checks all the boxes and since they all know the names of the others and made an order, he puts the name of of the following prisoner in Box 50. The following prisoner checks the first 50 boxes of the name of the following prisoners name and if he finds it, he waits an addition 15 mins for example. The next prisoner now either checks the boxes 1 to 50 or 51 to 100 and waits accordingly. This way everyone would find his name aswell, even tho it's not so smooth obviously
If there was no prisoner No.1 who can limit the largest possible loop to 50, the third riddle would not have 100% efficiency, but only about 30%. This way, it is ensured that each prisoner's number will begin at the end of the loop which is 50 boxes or less.
For the prisoner name riddle: couldn’t you just alphabetize the names of you and your fellow 100 and find the midpoint, assigning 2 groups, one with the first fifty names alphabetically and another with the last fifty alphabetically? Then, all the first prisoner has to do is put all the names in order alphabetically and take his own name, then every prisoner after that just opens whichever group of boxes his name falls into alphabetically (group 1: first 50, or group 2: last fifty) and takes his name which is guaranteed to be in that group.
One more strategy for the third one, prisoner one would give the prisoners a no. Acc. To their cells or they would remember it, prisoner one would arrange the Names from 1-100 and all the prisoners would have their names in the no. Of the cells or the no. That was given to them.
My answers 1- Pick 2 socks then go to the other room WITH lights 2-Green - knight Red - spy Blue - knave 3 Flip the one you have seen and do sign language to communicate or morse
I believe the problem with #3 is how does Prisoner#1 know everyones cell# and name by memory? (you might say "extremely intelligent") which leads to the question many people have wondered, why tf can't prisoner 1 just remember the names in each box? i'm sure prisoner#1 isnt allowed multiple days, nonetheless hours to go through all loops starting with #1 ect ect which like stated above, once opened box 1 he would have to know the corresponding Cell# with the name in the box. Which if he can remember 100 names and each of their corresponding cell#s, then why couldn't he just remember the names in each box... I suppose the only workaround for this, is if the piece of paper also INCLUDES the Cell# with their names, but that wasn't stated within the riddle.. EXTRA: even if the paper had both the Name and Cell# for each prisoner, the question still remains how long does he have to go through all 100 and choose the 2 swaps..? given enough time sure it could be done but ONLY if the cell# was given as well because if its not, then that would mean he remembered everyones cell# as well as their names for each cell, and idk about anyone else, but remembering 100 names is hard enough but adding in a 1-100 number to go along with those 100 names...not happening, besides in prison they probably don't use their real names all the time. oh well.
Just my understanding on 1, anna wakes up in a dark room, need a pair of matching colour socks, the line got 23 black and 17 white, the answer say she need 3 cos the 3rd one will match either 1st or the 2nd. My ques is why we assume the 1st and 2nd are different colour? Cant anna grab the 1st and 2nd to be the same colour?
1. Grab 5 cause then it's likely you'll have two pairs of the same color (I was right in the thinking but wrong cause i misunderstood what the amount she required was) 2. Julien is the spy (YUSH!) 3. I gave up.
The 1st riddle actually became a test in my school XD on the combinatorics chapter, pigeon hole principle section. The 2nd riddle is actually easy. It's only hard if you refuse to do it in the first place XD My way of thinking: If Jeff were the spy, then the other two are liars - won't work since both of them can't be the knight. Since Jeff told the lie and is not the spy, then Jeff is the knave. Julien's statement revealed that he can't be the knight therefore he must be the spy. For the 3rd riddle... Thanks, minutephysics.
There is just one loop in the last riddle..... you just made up the loop thing for an answer.... But there is a way provided every prisoners can see the prisoner entering the room and leaving..... Prisoners can decide the order in which they enter, they all just have to memorise it.... now first one can open all boxes to find his name and he must put the name of the upcoming prisoner in the first box.Then the second one knows, his name is on the first box. So he has to open the remaining boxes from 2-50, opening each box within a second. If he find the name of the no.3rd prisoner lying within 50, he just open his box no.1 and leave the room.... if he find no.3 prisoners name in box no.23, he has to leave the room at 23rd second which will convince the other prisoners that no.3 prisoners name is on 23rd box. Now no.3 will come and open box no.2-51 excluding 23.... if he finds no.4 prisoners box, he will leave the room at that second opening his own box. If he cant find the box he will leave the room only after all 100 seconds which implies the other prisoners that the name of the fourth prisoner is after 52nd box..... now no.4 enters and open the boxes from box 50 looking for his name and also for next prisoner, he will definitely find his own name and if he can find the other prisoners name in any of the rest of the box he opened he will leave the room at a second between 101 and 200 which denotes box no. 1-100..... and if he do not find no. 5 prisoners box he will leave the room after 200 secods.... no. 5 enter the room and look for his own box and the other prisoners name and repeat the same process...... this is almost impossible but 100% accurate
there's only one flaw on the 3rd riddle, you mentioned they aren't able to speak to each other, so how would all of them think of the strategy to begin with? meaning how would they know to name them self's as numbers? p.s. i never assume prisoners are unwise people(though they got caught in action), cause there are intelligent folks in prison but still.
In the first one it says there are 23 black and 17 white socks but it doesn't say there aren't any other colors or how many there are. Actually I don't see ANY white or black socks on the clothesline, but I do see red, blue, green and yellow, so if there are white and black ones that are out of view, that means she needs to get at least 7 socks then, not just 3. Also, she's just going to go to her job interview wearing that tank top and socks but no shoes and who knows what she's wearing downstairs? I'm not complaining. The job will be mine!
the 3rd one was easy af. I'd say that the first one put the name of each prisoner in the box with the number of the prisoner (every prisoner has a different number).
Third one doesn't make sense. You don't get any hints when opening boxes so you're not told how the loop should look. That alone means there is at least one loop so video creator is wrong. And you said they can't communicate with each other although you still make them tell about what loop to follow? If that's the case and they can communicate then just let first one walk in, open all boxes, check all names, remember them and make the first guy set up the order equal to the names and tell them to open box+1? So he walks in, open boxes, sees names Box 1 - Anna, Box 2 - William, Box 3 - Michael etc. etc., and sets order so Anna walks in first, William walks in second, Michael walks in third and tell them to open Box+1, so Anna opens the first one, William one after the first one, etc. Way easier than your method and doesn't break any rules considering you allowed them to communicate about the order of loop.
The last riddle is worded awkwardly, I mean with that logic they each can change the places of as many names as they want for your solution to work. I think you mean they can take the names and move them but only the first can just swap 2 after he finds his.
I know how to answer #3 with a 99% chance of success. Basically, have the prisoners line up in alphabet order. Then each prisoner will count what place they are in. Once the first prisoner goes in to look at the 100 boxes, he just places them all in alphabetical order. From there, the prisoners just need to remember what place they belonged to. The only way this can fail is if one prisoner forgets their place number.
That's what I can't get either. The rules are dumb as hell and poorly explained. Why not just have every prisoner be odd or even and place those names accordingly? 0% chance of losing. But I can't figure out if the first guard can move all the names or only 2. Horrible wording throughout many of this guys riddles
took 15 mins...but i solved the 2nd riddle!!!!! YESSSSS!! Finally one video where i solved something
ua-cam.com/video/kDKLMv1jKEs-/v-deo.html try this new challenge if u r really genius..
I solve every riddle without pausing
3rd one is formulated really Bad. The prisoner who can look in all boxes is he one of the 100 prisoners? So only 99 should know the number of the Box with their name in it. because the prisoner who can look in all boxes has a 100% Chance
So true
No they are not allowed to communicate
The hardest part of solving these riddles is understanding the explanation of what you are trying to solve.
On the last riddle
Prisoner: LETS RIOT
The biggest question is, how is her room pitch dark in the morning when she overslept?
Because she usually gets up at 3. happy now?
Or maybe she sleeps in the basement with no Windows. That could be a reason as to why it is still dark
She lives above the arctic circle so uses blackout curtains
3rd Shift
Why not:
• Every prisoner gets his number
• First prisoner swaps names that Prisoner 2 gets his name in box 2.
Prisoner 3 gets his name in box 3
100% wins
Jakub Mroczek you can swap 2 names only once
switch the boxes not the names
To_5BG- Казармата на Крийпърите he was talking about if it would be like that
Jakub Mroczek that’s what I thought I was totally lost on that last one
Me too
I got the last one correct but the first 2 I failed
EDIT: THANKS SO MUCH FOR THE LIKES GUYS😃😃😃😎😎
Sounds like you got a weird brain ;)
Riddle Channel yep
Same with me !!
VKarl exactly
Yash Londhe glad I'm not the only one
I think Anna is a doctor because i can't understand her writing
lmao
;)
I confirm the solution is perfectly viable.
The ones who disagree simply have to reflect on the riddle a bit more and understand it. The most frequent argument is that even if the first prisoner will guarantee there's no loop of more than 50 names, it's not guaranteed each and every prisoner will pick the loop with his name in it, thus finding it. This argument is fully invalid, as it is guaranteed he will pick the right loop simply because the box with his name always leads to the box of his number (thus they're in the same loop) and every prisoner starts looking into the box of his number.
There is the thing. if the first is in a smaller loop, that is inproblable, all die. there is no chance of full success. It can be a chance of all go througt or all die. Even if the first on identify that there is a loop bigger than 50. He is alredy dead. Becouse he doesn't know wich box replace.
Prisoner Riddle:
The first one puts all names into Box 1.
Done.
Hahaha
I don't agree with your solution to #3. Yes, the first prisoner can ensure that no loop exceeds fifty boxes. So there will be two or more loops. That doesn't guarantee that any prisoner will find his own name. To do that he'd have to work the correct loop, and he has no hint on where to find it.
Exactly right. I'm disappointed no one else has realized this yet.
I agree with you... I think the person posting the riddles is suffering from brain scramble on #3...
I started reading through the comments to see if someone agreed with me ... If we give this thread a thumbs up, others will find it faster ...
yea exactly, wtf? you can't gurantee that everyone will find their name in under 50 boxes by cutting 1 loop
The prisoner will always be in their own loop. It is necessarily true that their start box and name box must be in the same loop, since their name box is the one that comes before their start box (thus forming the loop)
They are always in their loop because they start with their corresponding number.
So this "Anna" wakes up in the morning and cannot find her socks. Wtf is there no light in her room? Or even a window?
God,
if she lives in a basement, where's the stairs or at least the door out? i mean how could she find her clothes or the socks, IN THE FUCKING DARK.
lol and she can just crab like a couple socks and go outside in the sunlight to see!
okay... just say, she's blind. feeling better now?
Then she wouldn't know which one of the three is incorrect, since she can't see,
I don't get what you are trying to say for the last one ?
On the first one i just said take all the socks...😂
No light in their room, no job, getting up late for an interview, not having their clothes already laid out. If a person can't get their stuff together that would be their best option.
Riddle 3- Easiest way
As 1st person can change any box and can look them
He will plan with other mates that he will arrange everyone name from 1-100 acc to alphabet sequence (like dictionary). As everyone know there name they will able to know the box Number with there name as already discussed with eachother .
Quite easy
Any two boxes
Not every box
The third one was easy, I got stuck on the freaking socks
I said 4
_ TheBigPig _ same
Yup ikr
_ TheBigPig _ mine was the other way around
Same!!!
Ok, The first on my me laugh so hard, it was just so stupid and I know it's a riddle but still like who does that
When I've heard the sock riddles it's always with at least 6 or more colored socks, not just black and white lol.
Carter learn how to use grammar bitch
Carter and general spelling you capitalized the for no fucking reason
Killua Zoldyck and if you want to nit pick about capitalisation, I'll nit pick about your lack of punctuation.
Shouldn't it be:
You didn't need to capitalise " the "?
Killua Zoldyck It should be:
'Learn how to use grammar bitch.'
'And general spelling; you capitalized 'the' for no fucking reason.'
I got number 2 and number 3.
good job :)
6:15 "If there's a loop that is over 50 steps long, there can only be 1"
I don't understand. A loop can even be 99 steps long, say if each box contained the name of prisoner "n+1." If we are to proceed with the strategy, many prisoners will miss their names because the can only open until the 50th box. In fact, I believe almost all of them will miss their names.
EDIT: Figured out how to close 100 step loop into 2 loops: The 100th box is supposed to contain what should be in the 1st box. Just switch the contents of the 100th box and the 50th box.
1: fail
2: fail
3: literally the hardest one..... I got it 🤦♂️
first 2 are too ez, but the third, iyes they are smart, but they're not good memorizers, so they cant memorize the names, cant the first one just walk in and align the names in alphabatical order and then let the prisoners go in, in alphabatical order too?
AFK able the first can only swap two names once.
AFK able there isnt 100 letters in the alphabet
But not all names are ONE LETTER LONG DINGUS
mR Dub and Paul Smith , no there arent 100 letters in the laphabet, but if 2 ppl have the same letter, then u order them according to their seccond letter's alphabetical order, and in case the second is also the same, u do the same process with the third letter, and so on.
example: if there are 3 people names: nelson, nijel, jeffery
first is jeffery
then is nelson, because letter (e) comes before the letter (i) in the alphabets
and last is nijel
Tabirca Radu ah ok, makes sense, can u explain the solution though? i dont see how doing what he explained garuantees in all of them finding there names.
I only got the 2 one right
mackayla campbell BAAAAAAD CHANNEL number one was wrong number 3 was long
Number 1 was correct. You only need to grab 1 more sock than there are colors to guarantee at least 2 will match. Number 3 was confusing.
Dude I have found another strategy... When they discuss the strategy they tell the first prisoner that is aloud to switch all boxes as he wants to put every prisoners name in alphabetic order....the alphabet is like 21 letters long sooo every prisoner can open 50 boxes and the possibility to find his name is tooo high
Bro it was mentioned that he can only open the boxes and have to leave em just the way they were
Riddle 3: Another way to solve it that makes it easier for every prisoner except the first one:
The first prisoner memorizes the order of the prisoners entering, and each prisoner memorizes their own number.
The first prisoner puts the second person's name in the second box, third in the third box, etc.
The prisoners open their own box and immediately leave.
Exactly that’s actually the solution
Michael:Jeff is the knave
Julien:Michael is the knight
Jeff: My name is jeff
2nd is the easiest
With the third, why can't the first prisoner check who's next, find their name and swap it with box 2? Dunno id i'm missing something but it says he can check in all of them and swap two around, this should work. (Hopefully)
I mean, he could but all that does is leads number 2 to getting his name. It doesnt bring any security to prisoners 3-100
only 1 prisoner can look in all 100 boxes and cqn only switch 2 names. the rest can only open 50 boxes and have to leave the boxes exactly how they were.
or since they numbered and he/ she memorized numbers with names. he would just put them into numbers... idk if ui make sense, but you are allowed to switch as many times
Mr Neos48 THE FIRST PRISONER JUST DOESNT CHANGE ANY NAMES BC IT WOULD BE STUPID TO ENDANGER HIMSELF
So does everyone need to get their names or is it like an every man for himself thing where if u get ur name u live?
why the fuck would you say your the spy?!?!?!??!?!
people like you make me want to shoot children.
Meaty one 😂😂😂😂😂
It's a riddle, it's not real life
Yay een nl
Ik ben een pedofiel he would need to memorize the order of the 100 prisoners
About that last one riddle - there is one much better solution. Everything starts with mutual agreement, a week before the game. Every prisoner will have his unique number. For example - prisoner John Smith will have the number "6". When the game begins, some prisoner goes to the boxes, opens them all and finds the name "John Smith". After that, it's enough to knock on the lid of that box for six times. His friend John Smith will understand that in exactly THIS box is his name. This ''knock-guy'' prisoner will knock on the other boxes in this way, sending the relevant signals to other prisoners each according to the number of knocks. In this way, everyone will know where to go and which box to open because everyone has his own unique number that is the same as the number of knocks, and that ''knock-guy'' knows them. And even if the prisoners were wrong to see it, just go to the area where it was knocked - each of them has 50 attemps.
It was amazing.Specially the prisoner loop .Just amazing!
Riddle 3: The first guy puts the names in alphabetical order.
you can only switch 2 names, once.
Lin J 4:30 read the bottom rule
Now realise that he made a typo and the prisoner could only switch 'two names', not 'to names'
Bodelicious that what I thought too
but they didnt say anything about switching the boxes
the first riddle was a no shit
2riddle is easy he said there is a spy BETWEEN his men and there is only three so it got to be the second one
Family's Kids Nice one.
What funny is I heard his name was Julian and my first thought was "That's the name a damn spy would have." and by Jove I was right...
Tomiho
1) Alternative: Black socks are pretty much thicker than most white socks, let alone how she should at least identify which is lighter and darker.
2) The guy in the mid.
3) If the first pri. Can arrange it, they should just arrange it chonologically, different from yours though..
In riddle 3: In the explanation or solution there was no hint that the first prisoner has a limit of swapping names. So it could be very simple to solve just by swapping the names of the prisoners until they are in the same order as the order they enter. This way only the first prisoner would open all the boxes reorder the names in them and than all of the other prisoners would solve the riddle by opening only the box corresponding to their order number. They could even order themselves alphabetically so that the first prisoner doesn't even need to remember their names, but only order the names in the boxes alphabetically. The other prisoners would not be required to remember anything else than their number in the order.
I knew the second one was jullien!!
Yeah, that's wrong, bud.
I thought the prisoners had planned their order so couldn't the first person change the boxes by order, so third person would pick box three? I probably am missing something and sound really dumb
You are correct. I think he misspoke in regards to the rules of that riddle...
He can switch 2 boxes only once
1:41 MY NAME IS JEFF XD!!?>>>
I got all correct and I'm 10
damn, I chose correctly on the second on because you said 'there is a spy between his men' and Julien was in the middle..
the last riddle is stupid.. lol are there cameras or something.. is there no rule in changing the boxes themselves... lol if not.. the first guy should be someone who knows everyone's name.. and put the boxes themselves in the order the prisoners came up with.. id say best to put them in alphebitcal order lol... the numbers are irrelevant here.. just like they were in the sock riddle... lol how are the numbers on the boxes.. can't you just swap the numbers and organize the boxes in alphabetical order.. so the prisoners are guaranteed to know it's their box no matter what lol... haha all this lies on number one prisoner lol he can't mess this up or everyone is executed
There is a typo in the statement of the rules. The first prisoner can swap any *two* names. No more.
one prisoner writes the 100 names on 100pieces of paper and give each other a paper with is name. they each chose a number from 1 to 100. Prisoner k removes and eat the original paper from box k and replaces it with the paper with his name written on.
4:38 he spelled two wrong (to)
3:47 so if they couldnt communicate how did they come up with a plan EXPOSE HIM!!!!!!!
+Sweet Niya, He said you can't communicate in cells, however the warden gave them some time (Break actually to make a Strategy ) Which they did , i mean you can't like a prisoner go to pick his number (Name then come back and tell the next cell "Hey.. i got no.1 , try picking the other one" That what he meant
I don't know if it wasn't communicated well or what, but even if someone can swap 2 names at he very beginning, there's still the chance for failure. There are effectively 99 boxes and 99 people each only only get 50 tries at once, since only the first person can swap names & look at all boxes. All it takes is for 1 person not finding their own name.
Maybe I'm just misunderstanding the solution or something
Never heard the swap variant of riddle 3. Very cool!
I have better solution for this riddle first one can arrange it in the form of alphibitic form souppose, if someone name starts with A he should numbered at starting few boxes and next B and so on. by this others 99 can open 50 boxes in which they can open according to their first alphabet so by this they don't need 50 boxes to open they can easily find by just 25
You don't know how to tell these riddles my friend. No disrespect to you, I swear I don't mean any disrespect but I've heard them before and you're not doing a good job saying them. People can get confused because you can not articulate the riddles correctly.
Aaron Monroe I don't think that is really nice
JIGYASA SETHI yeah that is not
Sujatha Ramakrishnan I know. He's just being a bully. It doesn't matter if he talks funny or is not good. At least he's trying!
JIGYASA SETHI WTF IS WRONG WITH YOU? Get tf out of here, if this guy is a UA-camr and is trying to entertain people he should be prepared for criticism. Go hide in ur safe space you snowflake
JIGYASA SETHI I’m not trying to be “mean” but I just get sick of this political correctness now. Merry Christmas and God bless you!
i got 1 and 2 but 3 was too hard
I'm high asf
Wutttttttt?????😰
1.- 3(duh)
2.- The guy in red
3.- He puts them in alphabetical order
2nd answers
Michael:knight
Julien:spy
Jeff:the LiEr
I don't get number 3?
shadow nova neither did i
Think its fake :)
What if there's 3 socks in a row that are all the same color? Not really thought out I see
You really did not get that one didn't you? That's not how it works. Since there are only two colors and if you get two socks that are diff colors then the possibility of getting the same color of either one of the previous two socks is 100% since you used up the 1/2 probability. You're using a paradox to the riddle saying that you can get three of the same color when in the riddle it starts off of grabbing only *two* socks.....and by obvious means, if the two socks are both the same color then what is the point of getting a third sock in the first place-disregarding if it might be the same color or not.
rivetRose No I got it, I just wrote a comment saying that it doesn't make sense, that's sarcasm if you didn't get that either
Christian Maund he doesnt
What if you're not certain that you got 2 different colored socks at the start?
IEatWhenI'mBored it still doesn't matter like explained before as long as you grab 3 socks your good
1. If you grab white then white your already good 2. If you grave black then black your already good 3. If you grave black then white or white then black guess what when you grave the third it has to be either white or black now you have a pair for sure hence why yo u wanna just grave 3 it's a paradox by grabbing 3 your 100% to have a pair in your hand with the info the riddle gives us we are assuming she's grabbing these socks n putting them on in car where she can see but she wants to be sure when she make it to where ever she can see she want to have a pair
Riddle 1: what if there's 5 black socks in a row
Then obviously you’ll have a pair of black socks?
julien is the spy, Jeff is a knave , michale is a knight
OMG OMG he ANSWERD, you are the BEST
Riddle 3:
If prisoner 1 is allowed to open up all the boxes and change the names the way he wants, why doesn't he just rearrange them in an alphabetical order (family name)? The day before, they line up alphabetically and see e.g. "Krustchow is number 11" etc. If the first prisoner then rearranges the cards, every prisone besides the first one has to open only one box.
I foresaw your solution, but the problem is, you cannot learn 99 names in one night. More importantly, 100 prisoners will unlikely know each 99 prisoner in just one night. One might fail to remember a name which will result in failure for the team. Go on, rant on me for being so picky. It will work either by remembering the names or by rearranging the cards alphabetically.
This last riddle is similar to your other riddle with the money. TEDed also did a similar video with instruments.
my name is jeff
Shane Kim ugly fat kid
are you the same jeff of coc?
i am abig fan of coc
What does my name is jeff have to do with riddles, ugly and you stupid
i sorry but i dont get it!
The first one you can turn on the light or get a flash light
Oh really, smartypants? What if you don't have one or the electricity went out? Do you really think you're smart?
If you were listening clearly it said that the girl's lamp was broken so she has no light.
Yes I got all of them!
The first prisoner can't switch more than two names from the boxes, but there is no rule preventing him from rearranging the boxes themselves. He can just put the boxes in the order the prisoners come in starting from the box containing the name of the first prisoner and they will all just need to open one box to find their names. Think outside the box, lol.
How come I got riddles two and three right but not riddle one
He can't just swap any two name in a loop to cut it in half ... if you swap two success numbers you merely reduce the loop by one.
Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 4) -> Box 4 (Name 10) -> Box 10 (Name 1)
If you swap The Name in Box 8 with Box 72 ... you get a single loop Box 72.
But the loop goes
Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 4) -> Box 4 (Name 10) -> Box 10 (Name 1)
Now if you swap Box 3 with Box 4
Box 1 (Name 3) -> Box 3 (Name 10) -> Box 10 (Name 1)
And
Box 4 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 4)
Or if you swap Box 72 with Box 10
Box 1 (Name 3) -> Box 3 (Name 8) -> Box 8 (Name 72) -> Box 72 (Name 1)
And
Box 4 (Name 10) -> Box 10 (Name 4)
So the idea just swapping two names in the sequence will "cut the loop in half" is wrong.
Julien may be the spy but because Jeff CLAIMED to be the spy he can be held as an accompanist
Isn't there another solution for the 3rd problem using the time each prisoner spends in the room with the boxes? So the first one checks all the boxes and since they all know the names of the others and made an order, he puts the name of of the following prisoner in Box 50. The following prisoner checks the first 50 boxes of the name of the following prisoners name and if he finds it, he waits an addition 15 mins for example. The next prisoner now either checks the boxes 1 to 50 or 51 to 100 and waits accordingly. This way everyone would find his name aswell, even tho it's not so smooth obviously
1 wrong
2 right
3 right
If there was no prisoner No.1 who can limit the largest possible loop to 50, the third riddle would not have 100% efficiency, but only about 30%. This way, it is ensured that each prisoner's number will begin at the end of the loop which is 50 boxes or less.
For the prisoner name riddle: couldn’t you just alphabetize the names of you and your fellow 100 and find the midpoint, assigning 2 groups, one with the first fifty names alphabetically and another with the last fifty alphabetically? Then, all the first prisoner has to do is put all the names in order alphabetically and take his own name, then every prisoner after that just opens whichever group of boxes his name falls into alphabetically (group 1: first 50, or group 2: last fifty) and takes his name which is guaranteed to be in that group.
One more strategy for the third one, prisoner one would give the prisoners a no. Acc. To their cells or they would remember it, prisoner one would arrange the
Names from 1-100 and all the prisoners would have their names in the no. Of the cells or the no. That was given to them.
My answers
1- Pick 2 socks then go to the other room WITH lights
2-Green - knight
Red - spy
Blue - knave
3 Flip the one you have seen and do sign language to communicate or morse
Got first two. No way I'm getting the third. Having hard time even after the explanation lol
"What's in the box?!!!" (Brad Pitt quote from the movie Seven)...look it up.
1: right because I am smart
2: right also I AM SMART
3: RIGHT AGAIN I AM SMART
I believe the problem with #3 is how does Prisoner#1 know everyones cell# and name by memory? (you might say "extremely intelligent") which leads to the question many people have wondered, why tf can't prisoner 1 just remember the names in each box?
i'm sure prisoner#1 isnt allowed multiple days, nonetheless hours to go through all loops starting with #1 ect ect which like stated above, once opened box 1 he would have to know the corresponding Cell# with the name in the box. Which if he can remember 100 names and each of their corresponding cell#s, then why couldn't he just remember the names in each box...
I suppose the only workaround for this, is if the piece of paper also INCLUDES the Cell# with their names, but that wasn't stated within the riddle..
EXTRA: even if the paper had both the Name and Cell# for each prisoner, the question still remains how long does he have to go through all 100 and choose the 2 swaps..? given enough time sure it could be done but ONLY if the cell# was given as well because if its not, then that would mean he remembered everyones cell# as well as their names for each cell, and idk about anyone else, but remembering 100 names is hard enough but adding in a 1-100 number to go along with those 100 names...not happening, besides in prison they probably don't use their real names all the time. oh well.
Just my understanding on 1,
anna wakes up in a dark room, need a pair of matching colour socks, the line got 23 black and 17 white, the answer say she need 3 cos the 3rd one will match either 1st or the 2nd. My ques is why we assume the 1st and 2nd are different colour? Cant anna grab the 1st and 2nd to be the same colour?
1:correct
2:correct
3:correct
I love riddles so I subscribed
Third was interesting, first two were easy, not need to pause video even. Got all three of them anyway :-)
1. Grab 5 cause then it's likely you'll have two pairs of the same color (I was right in the thinking but wrong cause i misunderstood what the amount she required was)
2. Julien is the spy (YUSH!)
3. I gave up.
2nd one's incorrect...
The 1st riddle actually became a test in my school XD on the combinatorics chapter, pigeon hole principle section.
The 2nd riddle is actually easy. It's only hard if you refuse to do it in the first place XD
My way of thinking: If Jeff were the spy, then the other two are liars - won't work since both of them can't be the knight. Since Jeff told the lie and is not the spy, then Jeff is the knave.
Julien's statement revealed that he can't be the knight therefore he must be the spy.
For the 3rd riddle...
Thanks, minutephysics.
Anna wakes up from a nap and just like "OH SH*T I NEED TO BE AT AN INTERVIEW"
Michael Knight.... I see what you did there. :D
There is just one loop in the last riddle..... you just made up the loop thing for an answer....
But there is a way provided every prisoners can see the prisoner entering the room and leaving..... Prisoners can decide the order in which they enter, they all just have to memorise it.... now first one can open all boxes to find his name and he must put the name of the upcoming prisoner in the first box.Then the second one knows, his name is on the first box. So he has to open the remaining boxes from 2-50, opening each box within a second. If he find the name of the no.3rd prisoner lying within 50, he just open his box no.1 and leave the room.... if he find no.3 prisoners name in box no.23, he has to leave the room at 23rd second which will convince the other prisoners that no.3 prisoners name is on 23rd box. Now no.3 will come and open box no.2-51 excluding 23.... if he finds no.4 prisoners box, he will leave the room at that second opening his own box. If he cant find the box he will leave the room only after all 100 seconds which implies the other prisoners that the name of the fourth prisoner is after 52nd box..... now no.4 enters and open the boxes from box 50 looking for his name and also for next prisoner, he will definitely find his own name and if he can find the other prisoners name in any of the rest of the box he opened he will leave the room at a second between 101 and 200 which denotes box no. 1-100..... and if he do not find no. 5 prisoners box he will leave the room after 200 secods.... no. 5 enter the room and look for his own box and the other prisoners name and repeat the same process...... this is almost impossible but 100% accurate
there's only one flaw on the 3rd riddle, you mentioned they aren't able to speak to each other, so how would all of them think of the strategy to begin with? meaning how would they know to name them self's as numbers?
p.s.
i never assume prisoners are unwise people(though they got caught in action), cause there are intelligent folks in prison but still.
What a smart and deficut questions
In the first one it says there are 23 black and 17 white socks but it doesn't say there aren't any other colors or how many there are. Actually I don't see ANY white or black socks on the clothesline, but I do see red, blue, green and yellow, so if there are white and black ones that are out of view, that means she needs to get at least 7 socks then, not just 3. Also, she's just going to go to her job interview wearing that tank top and socks but no shoes and who knows what she's wearing downstairs? I'm not complaining. The job will be mine!
Got them all right.
I was right on the 2nd one WOOWHOO ._.
I got no.1 & 3 easily
But lost no.2
I did them all!
the 3rd one was easy af. I'd say that the first one put the name of each prisoner in the box with the number of the prisoner (every prisoner has a different number).
Third one doesn't make sense. You don't get any hints when opening boxes so you're not told how the loop should look. That alone means there is at least one loop so video creator is wrong. And you said they can't communicate with each other although you still make them tell about what loop to follow? If that's the case and they can communicate then just let first one walk in, open all boxes, check all names, remember them and make the first guy set up the order equal to the names and tell them to open box+1? So he walks in, open boxes, sees names Box 1 - Anna, Box 2 - William, Box 3 - Michael etc. etc., and sets order so Anna walks in first, William walks in second, Michael walks in third and tell them to open Box+1, so Anna opens the first one, William one after the first one, etc. Way easier than your method and doesn't break any rules considering you allowed them to communicate about the order of loop.
In riddle 3, can the first prisoner switch any number of names in boxes or just one pair?
The last riddle is worded awkwardly, I mean with that logic they each can change the places of as many names as they want for your solution to work. I think you mean they can take the names and move them but only the first can just swap 2 after he finds his.
I think
The first one was Hard
The Second one was Medium
The Third one was EZ Eassy
I know how to answer #3 with a 99% chance of success. Basically, have the prisoners line up in alphabet order. Then each prisoner will count what place they are in. Once the first prisoner goes in to look at the 100 boxes, he just places them all in alphabetical order. From there, the prisoners just need to remember what place they belonged to. The only way this can fail is if one prisoner forgets their place number.
That's what I can't get either. The rules are dumb as hell and poorly explained. Why not just have every prisoner be odd or even and place those names accordingly? 0% chance of losing. But I can't figure out if the first guard can move all the names or only 2. Horrible wording throughout many of this guys riddles
LOL!!! I got all riddles but the easiest.
Love this channel so much.
I GOT ALL RIGHT (Honest)
Got them all right
I did all the riddles, easyyy