Markov Chains & Long-Run Behavior · Superchallenge problem

A knight makes a random walk on an ordinary $8 \times 8$ chessboard: each move is chosen uniformly among the legal knight moves from its current square. Starting in a corner, what is the expected number of moves until it first returns to that corner?