Lattice covering by two random walkers in one dimension

We study the average time necessary for two independent random walkers to cover a periodic one-dimensional lattice completely, as function of the lattice size and the starting positions of the walkers.