The Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: George Penney's Chestnut
Replies: 1   Last Post: Jun 17, 1996 11:29 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
Michael Wodzak

Posts: 182
Registered: 12/3/04
Re: George Penney's Chestnut
Posted: Jun 17, 1996 11:29 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



>
> The solution, to save George Penny both from further embarrassing himself
> and from the pecuniary discomfort of dispensing CRAKKER JACKS to the
> hundreds in this group who are quite capable of solving it, is
>
> Ask either guard which door the OTHER guard would say leads to freedom,
> and then exit the opposite door.
>
> daan



Perhaps this is tougher:

Same scenario but with n doors, k of which are fatal, n-k not.
n guards, s of whom always tell the truth, n-s always lie.
For a given n, k and s, how many questions are needed to be certain of
going through a safe door?

Michal







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2017. All Rights Reserved.