In rotor-router walk on Z^2, a walker who leaves a site (i,j) does not make a random choice about where to go next, but rather chooses among the neighbors of (i,j) according to a deterministic (indeed, periodic) rule that ensures that each neighbor gets picked a quarter of the time. Rotor-router walks have many similarities to random walks, but also many important differences. Analyzing...