The expected number of steps for a knight to move from the lower left to the upper right corner of the chess board

330 Views Asked by At

What is the expected number of steps for a knight at each step executing a legal move with uniform probability to move from the lower-left corner to the upper-right corner of the chessboard? Of course one can solve a big system of (some $36$ or so) linear equations, but I suppose there is some trick making use of some symmetry. Perhaps it is related to this question on the expected return time for the knight on a chessboard corner.