Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024. Alexandr Gribalko