A knight is standing at one corner of an $8 \times 8$ chessboard and it has to reach the opposite corner.The minimum number of steps required by him to do so is 6.
Find the number of paths by which it can reach the other end in 6 moves.

Your answer seems reasonable.
Find out if you're right!