Twist on this riddle:
In this scenario, what if the positions of the switches were unknown? How will the strategy have to be adjusted so that they can still be freed?
Hidden:
First person who goes in makes sure A is on on either by moving it up or moving b if it’s in the on position already the rest continues...
First explain why the original strategy won't work.
Hidden:
Because let’s say the deal is that only the captain can open switch B. If others find it open they should close it, this way captain keeps count.
In this case I wouldn’t know how to start. Because whatever they decide to do can happen without the captain even entering the first time.
Twist on this riddle:
In this scenario, what if the positions of the switches were unknown? How will the strategy have to be adjusted so that they can still be freed?
I have a solution, but it would immensly prolong the suffering... but it would keep them from being hanged...
Hidden:
Every prisoner, except Mr. A, has to switch switch A up twice, at the first possible occasion, Mr. A switches it back to down every time he goes in...
He would have to count 44 downswitches...
Because even if the switch is on "on" to begin with, this would only get the count to 43 downswitches if one of the 23 prisoners never went in...So it does not matter whether the last prisoner gets to switch just once, because the switch was "on" to begin with, or the switch was closed and everyone switched it on twice.
Last edited by ChanieMommy on Wed, Oct 21 2020, 8:01 pm; edited 1 time in total
I have a solution, but it would immensly prolong the suffering... but it would keep them from being hanged...
Hidden:
Every prisoner, except Mr. A, has to switch switch A up twice, at the first possible occasion, Mr. A switches it back to down every time he goes in...
He would have to count 44 downswitches...
Because even if the switch is on "on" to begin with, this would only get the count to 43 downswitches...So it does not matter whether the last prisoner gets to switch just once, because the switch was "on" to begin with, or the switch was closed and everyone switched it on twice.
I have a solution, but it would immensly prolong the suffering... but it would keep them from being hanged...
Hidden:
Every prisoner, except Mr. A, has to switch switch A up twice, at the first possible occasion, Mr. A switches it back to down every time he goes in...
He would have to count 44 downswitches...
Because even if the switch is on "on" to begin with, this would only get the count to 43 downswitches...So it does not matter whether the last prisoner gets to switch just once, because the switch was "on" to begin with, or the switch was closed and everyone switched it on twice.
