A rook in chess can move any number of squares in the same row or column. Let’s invent a new figure, a "little rook" that can only move one square in each of these directions. If we start with the "little rook" in the bottom right corner of an \(8 \times 8\) chessboard, can we make it to the top left corner while visiting each square exactly once?