Prisoners, Rooms, and Lightswitches

Cited by: 0|Bibtex|Views2|Links

Abstract:

We examine a new variant of the classic prisoners and lightswitches puzzle: A warden leads his $n$ prisoners in and out of $r$ rooms, one at a time, in some order, with each prisoner eventually visiting every room an arbitrarily large number of times. The rooms are indistinguishable, except that each one has $s$ lightswitches; the priso...More

Code:

Data:

Your rating :
0

 

Tags
Comments