| |
| | [No title] (Site not responding. Last check: 2007-10-31) |
 | | THE RENDEZVOUS PROBLEM Two people are lost from each other a maze of n rooms. |
 | | If the problem is modified so that players are not symmetric and they are therefore allowed to follow different algorithms, i.e., one is a child and the other a parent, then the optimal solution is for the child to stay still while the parent looks for her (taking n/2 steps on average). |
 | | (I didn't intend to write so much about this problem, but I got carried away, thinking this might be an interesting problem for rec.puzzles or math.research, where I may post it.) Reference: Anderson, E.J. and Weber, R.R. (1990) The rendezvous problem on discrete locations", Journal of Applied Probability, 28, 839-851. |
| www.statslab.cam.ac.uk /~rrw1/abstracts/rendezvous (713 words) |
|