On Thu, Feb 13, 2003 at 11:16:16PM -0000, Alberto Monteiro wrote: > Chose 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
Seems like a nice simple solution. -- "Erik Reuter" <[EMAIL PROTECTED]> http://www.erikreuter.net/ _______________________________________________ http://www.mccmedia.com/mailman/listinfo/brin-l
