CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Products to download and subscription Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "k prisoners and k lightbulbs."     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange This and that Topic #881
Reading Topic #881
Randomer
guest
Aug-30-08, 06:38 PM (EST)
 
"k prisoners and k lightbulbs."
 
   This is a rather more complex variant of the '100 prisoners and a lightbulb' problem.

There is a prison, containing k prisoners. In addition to the cells of the prisoners, there is a 'special block' containing k identical cubicles arranged in a circle around the outside of a courtyard. Each cubicle contains a lightbulb, and a switch for turning the light on or off. The schedule for each day is as follows:

6am: All the lights in the special block are switched off.
7am: The prisoners are blindfolded and taken to the special block. One is placed in each cubicle and the blindfolds are removed. The prisoners may, if they wish, turn on the lights in their respective cubicles.
8am: The prisoners are blindfolded, and moved to different cubicles. Each prisoner moves one cubicle clockwise around the special block. The blindfolds are removed.
9am: The prisoners are taken back to their cells (blindfolded once more).

On day 0, one of the prisoners is singled out as 'prefect': He is told about the regime outlined above, and informed that if he can ever discover the number, k, of prisoners, then everyone will be allowed to go free. If, however, he guesses the number of prisoners and is incorrect then they will all be killed. He is allowed to spend all day thinking of a strategy, and at the end of day 0 he is allowed to send an email to all the other prisoners, outlining a suitable strategy for them to follow.

On day 1, the regime begins. The warder, having read the email containing the strategy, does his best to arrange the prisoners on each day in such a way as to hinder the prefect from discovering the number of prisoners.

In the interests of mathematical idealism, the warder orders the prisoners to refrain from attempting to send or recieve information in any way other than by turning the lights on or noticing whether they are on or not. For example, they may make no attempt to determine which cubicle they are in, or even whether they are taken to the same cubicle from day to day. If these terms are broken, all prisoners will be killed. In the interests of self-preservation, the prisoners follow this order.

Is there a strategy for the prisoners which guarantees that, whatever the warden does, the prefect can discover the number of prisoners? Or can the warden, with sufficient guile, keep them cooped up forever?

Happy thinking,

Randomer.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK