Markov Chains & Long-Run Behavior · Challenge problem

A king does a random walk on a $3 \times 3$ board: each move goes to one of the squares adjacent to its current square (horizontally, vertically or diagonally), chosen uniformly. Starting from the centre square, what is the expected number of moves until it first returns to the centre?