Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

If you think education is expensive, try ignorance. -- Derek Bok, president of Harvard

interests / rec.puzzles / Re: names in boxes

SubjectAuthor
* names in boxesduncan smith
`* Re: names in boxesG
 `* Re: names in boxesMike Terry
  `- Re: names in boxesduncan smith

1
names in boxes

<lBQDN.376975$Ama9.83178@fx12.iad>

  copy mid

https://novabbs.com/interests/article-flat.php?id=813&group=rec.puzzles#813

  copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx12.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101
Thunderbird/102.13.0
From: dun...@invalid.invalid (duncan smith)
Subject: names in boxes
Newsgroups: rec.puzzles
Content-Language: en-GB
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 22
Message-ID: <lBQDN.376975$Ama9.83178@fx12.iad>
X-Complaints-To: abuse@blocknews.net
NNTP-Posting-Date: Thu, 29 Feb 2024 00:54:41 UTC
Organization: blocknews - www.blocknews.net
Date: Thu, 29 Feb 2024 00:54:40 +0000
X-Received-Bytes: 1501
 by: duncan smith - Thu, 29 Feb 2024 00:54 UTC

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

Re: names in boxes

<l4b1ajF9ieoU1@mid.individual.net>

  copy mid

https://novabbs.com/interests/article-flat.php?id=814&group=rec.puzzles#814

  copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!3.eu.feeder.erje.net!feeder.erje.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: g...@nowhere.invalid (G)
Newsgroups: rec.puzzles
Subject: Re: names in boxes
Date: 29 Feb 2024 09:33:07 GMT
Organization: <Not Here, Not Me>
Lines: 28
Sender: Gip <gip@G15.fritz.box>
Message-ID: <l4b1ajF9ieoU1@mid.individual.net>
References: <lBQDN.376975$Ama9.83178@fx12.iad>
X-Trace: individual.net nfbDMicI1xqMGKTvL5gSUADdG+Aje8A/+bRp1UNPKRvYSNdxU8
X-Orig-Path: not-for-mail
Cancel-Lock: sha1:um97IE73sS/9OTnmPYWIexpnqBg= sha256:BOsJd/igWgx3iVLLxLC1c6KJyzD7iM1Bx5UttRnP0Xc=
User-Agent: tin/2.6.2-20221225 ("Pittyvaich") (Linux/6.7.5-200.fc39.x86_64 (x86_64))
 by: G - Thu, 29 Feb 2024 09:33 UTC

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

Re: names in boxes

<3PudnbFIPOZnLn34nZ2dnZfqnPudnZ2d@brightview.co.uk>

  copy mid

https://novabbs.com/interests/article-flat.php?id=815&group=rec.puzzles#815

  copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!border-2.nntp.ord.giganews.com!nntp.giganews.com!Xl.tags.giganews.com!local-1.nntp.ord.giganews.com!nntp.brightview.co.uk!news.brightview.co.uk.POSTED!not-for-mail
NNTP-Posting-Date: Thu, 29 Feb 2024 16:42:34 +0000
Subject: Re: names in boxes
Newsgroups: rec.puzzles
References: <lBQDN.376975$Ama9.83178@fx12.iad>
<l4b1ajF9ieoU1@mid.individual.net>
From: news.dea...@darjeeling.plus.com (Mike Terry)
Date: Thu, 29 Feb 2024 16:42:33 +0000
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Firefox/91.0 SeaMonkey/2.53.17
MIME-Version: 1.0
In-Reply-To: <l4b1ajF9ieoU1@mid.individual.net>
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <3PudnbFIPOZnLn34nZ2dnZfqnPudnZ2d@brightview.co.uk>
Lines: 36
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-hECosZ646nxQcdKqec9GeUNOfhuBIfoJNzkpW+fwmITJ0OBNI371no9XfzdYDl5ha7vx6LDJVzdRos0!yLnOc93RUf+NGsXcSnm8IT7so1RzNUYGVdzCVfW75JCqlLA7jHu4dkyk41LVv8ol1a5RmUUAtqUx!knSlMSGSrL+j8rtl/afZA4O9MPAb
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
 by: Mike Terry - Thu, 29 Feb 2024 16:42 UTC

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.

Re: names in boxes

<J5aEN.497085$7sbb.9946@fx16.iad>

  copy mid

https://novabbs.com/interests/article-flat.php?id=818&group=rec.puzzles#818

  copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx16.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101
Thunderbird/102.13.0
Subject: Re: names in boxes
Content-Language: en-GB
Newsgroups: rec.puzzles
References: <lBQDN.376975$Ama9.83178@fx12.iad>
<l4b1ajF9ieoU1@mid.individual.net>
<3PudnbFIPOZnLn34nZ2dnZfqnPudnZ2d@brightview.co.uk>
From: dun...@invalid.invalid (duncan smith)
In-Reply-To: <3PudnbFIPOZnLn34nZ2dnZfqnPudnZ2d@brightview.co.uk>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 46
Message-ID: <J5aEN.497085$7sbb.9946@fx16.iad>
X-Complaints-To: abuse@blocknews.net
NNTP-Posting-Date: Fri, 01 Mar 2024 01:22:49 UTC
Organization: blocknews - www.blocknews.net
Date: Fri, 1 Mar 2024 01:22:49 +0000
X-Received-Bytes: 2600
 by: duncan smith - Fri, 1 Mar 2024 01:22 UTC

On 29/02/2024 16:42, Mike Terry wrote:
> 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.
>

Exactly. I assume the prisoners should allocate numbers to themselves
randomly to guarantee the 0.3 probability of survival, as the problem
doesn't specify that the boxes are ordered randomly.

Duncan

1
server_pubkey.txt

rocksolid light 0.9.8
clearnet tor