> This puzzle has been making the rounds of Hungarian mathematicians' parties.
...
I broke down and googled for "the switch room" to get the
answer. It's a clever little problem, with a solution that can be
guaranteed to work. (Nothing probabilistic, as mentioned in my
last post.)
> "But, given enough time, everyone will eventually visit the switch room as
> many times as everyone else.
The interpretation of this statement needed to make the puzzle
work is weak. The following interpretation works: "For any number k,
eventually every prisoner will have visited the room at least k times."
---David
Had to peek...
_______________________________________________
http://www.mccmedia.com/mailman/listinfo/brin-l
