Markov Chains & Long-Run Behavior · Superchallenge problem

A knight wanders on a $3\times3$ board: each move goes to a uniformly chosen square that a chess knight can reach from its current square. Starting in one corner, what is the expected number of moves until it first reaches the diagonally opposite corner?