Prisoners, Rooms, and Lightswitches

  title={Prisoners, Rooms, and Lightswitches},
  author={Daniel M. Kane and Scott Duke Kominers},
  journal={Electron. J. Comb.},
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 prisoners win their freedom if at some point a prisoner can correctly declare that each prisoner has been in every room at least once. What is the minimum number of… Expand


One hundred prisoners and a lightbulb
This column is a place for those bits of contagious mathematics that travel from person to person in the community, because they are so elegant, suprising, or appealing that one has an urge to passExpand
Mathematical Puzzles: A Connoisseur's Collection
Collected over several years by Peter Winkler, of Bell Labs, dozens of elegant, intriguing challenges are presented in Mathematical Puzzles. The answers are easy to explain, but without this book,Expand
The wakeup problem
We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present ecient solutions to the problem and show how these solutions can be used to solve theExpand
Kominers’s conundrums: The warden has a brainteaser
  • Bloomberg Opinion (April
  • 2020
Problem S08-2
  • The Harvard College Mathematics Review
  • 2008
Problem S08-2 (corrected)
  • The Harvard College Mathematics Review,
  • 2008
Mathematical puzzles: A connoisseur’s
  • 2004
Car Talk Radio Show, Prison switcharoo
  • 2003
Buhler and Elwyn R . Berlekamp . Puzzle 4
  • 2002
, and Gadi Taubenfeld . The wakeup problem
  • Proceedings of the Twenty - Second Annual ACM Symposium on Theory of Computing
  • 1990