Two players are placed on the integer lattice Z (consisting of points in n dimensional space with all coordinates integers) so that their vector difference is of length 2 and parallel to one of the axes. Their aim is to move to an adjacent node in each period, so that they meet (occupy same node) in least expected time R (n) , called the Rendezvous Value. We assume they have no common notion of...