King's Tour Problem

A king makes a tour of the chessboard, moving one square at a time orthogonally or diagonally, visiting each intermediate square exactly once, and returning to the starting square on the last move.

Prove that the number of diagonal moves that the king made is even.