At 11:16 PM 2/13/2003 +0000, you wrote:
SpoilerChose one Prisoner, M, that will count something. The other prisioners are P2, P3, ... P23 (n = 23?)Each prisoner P_n must switch A from 1 to 0, but he must do it just _twice_.. After that, and when he finds A in 0, he will only switch B Prisoner M will switch A from 0 to 1 whenever possible [else he will switch B], and count how many times he does it. When he would do it the (2n)-th time, he will announce that everybody has entered the room. I don't know if it's possible to solve in less time Alberto Monteiro
That is pretty much the answer, except make the final count 2(n-1). No need for prisoner M to count himself. I mean he can, but just so he knows he is counting himself.
Kevin T. - VRWC
I don't know if anyone won.
_______________________________________________
http://www.mccmedia.com/mailman/listinfo/brin-l
