Question 5
The chess King was placed on a cell of the board $8 \times 8$, and then he made $64$ moves so that he visited all the cells and returned back to the initial cell. At each moment, we calculate the distance from the center of the cell occupied by the King to the center of the board. We call the move *pleasant* if after the move this distance became less than it was before the move. Find the greatest possible number of pleasant moves.
(By one move the chess King moves to a cell adjacent by a side or by a vertex.)
(By one move the chess King moves to a cell adjacent by a side or by a vertex.)