Eulerian and Hamiltonian Graphs · Challenge problem

Can a knight visit all $16$ squares of a $4 \times 4$ chessboard exactly once and return to its starting square, using only valid knight moves (each move is two squares in one direction and one square perpendicular)?