Markov Chains & Long-Run Behavior · Superchallenge problem

A robot does a random walk on a $3 \times 3$ grid of rooms, each step moving to a uniformly chosen room that shares a wall with its current room (no diagonal moves). Starting in one corner room, what is the expected number of steps until it first reaches the diagonally opposite corner room?