Question 1
In the diagram below, a $9\times9$ chessboard is shown where each unit square is alternately coloured in black or white and each of its four corners are all coloured in black. Now, a lame bishop starts on any black square. If in each move, it can go to any diagonally adjacent black square without visiting any white squares, what is the minimum number of moves required to be able to visit all the black squares, not necessarily returning to its starting square? Draw the path.
Answer: ___ moves. Draw the path on the original answer board.
Answer: ___ moves. Draw the path on the original answer board.