Ways in which a knight can reach the diagonally opposite corner

367 Views Asked by At

A knight is placed in a corner of an $8\times8$ chessboard. In how many different ways can this knight reach the diagonally opposite corner if it can not move on the same cell more than once?