Before revision:  For this }  , Alice and Bob have to achieve effective communication within the locker room. We show asymptotically matching upper and lower bounds for their optimal probability of success.
After revision:  For this } , even without knowing the object sought? We show that by providing advice of just one integer in \{0,1,...,n-1\}, one can improve the success probability considerably, by a \Theta(logn{loglogn show asymptotically matching upper and lower bounds for their optimal probability of success.