One knight starts at A1 and the other at H8. Alternating they jump randomly on the $8\times 8$ chessboard until one captures another. From each field the knight jumps to any other possible field with equal probability. Jumping of both knights form a Absorbing Markov chain.

What is the expected number of steps before one knight capture another?