Question 8
A knight is placed on a corner square of a $3\times3$ chessboard. A move takes it to a square reached by two horizontal steps followed by one vertical step, or by two vertical steps followed by one horizontal step. In how many ways can it reach the opposite corner square in exactly 12 moves?