# Knight is might!

Probability Level 1

On an $8 \times 8$ chessboard, can a knight move from one corner to the opposite corner, visiting each and every remaining square exactly once on its way there?


Clarification: A knight can move to a square that is either two squares away horizontally and one square vertically, or two squares vertically and one square horizontally.

×