Eulerian and Hamiltonian Graphs · Hard problem

A rook on a $5 \times 5$ chessboard starts at some square, moves one square up, down, left, or right at each step, visits every square exactly once, and attempts to return to its starting square. Is this possible?