Hello,
I've come across a problem (puzzle) in some Cambridge University (statistics) notes that I don't remember being posted here. So I thought
it might be of interest.
The names of 100 prisoners are placed in 100 boxes (one name in each
box) which are lined up on a table in a room in an order unknown to the prisoners. Each prisoner must enter the room and is allowed to look in
up to 50 boxes to try to find their name. If any prisoner fails to find
their own name, the they are all executed.
Each prisoner must leave the room in the exact state they found it when
they entered. No communication is allowed between any prisoners once the procedure has started. The prisoners are allowed to meet to devise a
strategy before the process starts. Find a strategy that gives the
prisoners a probability of survival of greater than 0.3.
Cheers.
Duncan
duncan smith <duncan@invalid.invalid> wrote:
Hello,
I've come across a problem (puzzle) in some Cambridge University
(statistics) notes that I don't remember being posted here. So I thought
it might be of interest.
The names of 100 prisoners are placed in 100 boxes (one name in each
box) which are lined up on a table in a room in an order unknown to the
prisoners. Each prisoner must enter the room and is allowed to look in
up to 50 boxes to try to find their name. If any prisoner fails to find
their own name, the they are all executed.
Each prisoner must leave the room in the exact state they found it when
they entered. No communication is allowed between any prisoners once the
procedure has started. The prisoners are allowed to meet to devise a
strategy before the process starts. Find a strategy that gives the
prisoners a probability of survival of greater than 0.3.
Cheers.
Duncan
I have seen this before, but I don't think this version is solvable as it has no way to connect a name with a box. The (solvable) version I know has the prisoner NUMBERS (from 1 to 100) randomly placed in the numbered boxes.
G
On 29/02/2024 09:33, G wrote:
duncan smith <duncan@invalid.invalid> wrote:
Hello,
I've come across a problem (puzzle) in some Cambridge University
(statistics) notes that I don't remember being posted here. So I thought >>> it might be of interest.
The names of 100 prisoners are placed in 100 boxes (one name in each
box) which are lined up on a table in a room in an order unknown to the
prisoners. Each prisoner must enter the room and is allowed to look in
up to 50 boxes to try to find their name. If any prisoner fails to find
their own name, the they are all executed.
Each prisoner must leave the room in the exact state they found it when
they entered. No communication is allowed between any prisoners once the >>> procedure has started. The prisoners are allowed to meet to devise a
strategy before the process starts. Find a strategy that gives the
prisoners a probability of survival of greater than 0.3.
Cheers.
Duncan
I have seen this before, but I don't think this version is solvable as
it has
no way to connect a name with a box. The (solvable) version I know has
the
prisoner NUMBERS (from 1 to 100) randomly placed in the numbered boxes.
G
Right - the prisoners would have to assign numbers 1-100 to themselves
and remember that association! Or maybe they can all write the list
down and take the list into the room with them...
Mike.
| Sysop: | Keyop |
|---|---|
| Location: | Huddersfield, West Yorkshire, UK |
| Users: | 300 |
| Nodes: | 16 (3 / 13) |
| Uptime: | 44:41:24 |
| Calls: | 6,710 |
| Calls today: | 3 |
| Files: | 12,243 |
| Messages: | 5,354,111 |