We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying a condition that involves only triplets of cards. Then we use it to analyze a classic model of card shuffling. In 1988, Diaconis introduced the following Markov chain. Cards are arranged in an $n$ by $n$ grid. Each step, choose a row or column, uniformly at random, and cyclically rotate it by one unit in a random direction. He conjectured that the mixing time is ${\rm O}(n^3 \log n)$. We obtain a bound that is within a poly log factor of the conjecture.