We show that the expected distance of a random walk from the origin behaves like $n^{1/2}$ for certain polycyclic and metabelian groups with exponentially distorted subgroups. We also prove a law of the iterated logarithm for these groups. If time permits, we will also present an algorithm for estimating the rate of escape of a specific random walk on some abelian-by-cyclic groups.