An ant can move from any square on an chessboard to an adjacent square. (Two squares are adjacent if they share a side). The ant starts in the top left corner and visits each square exactly once. Prove that it is impossible for the ant to finish in the bottom right corner. [You may find it helpful to consider the chessboard colouring.]
, 2014
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.