The numbers $1$ to $1024$ are written one per square on a $32 \times  32$ board, so that the first row is $1, 2, ... , 32$, the second row is $33, 34, ... , 64$ and so on. Then the board is divided into four $16 \times  16$ boards and the position of these boards is moved round clockwise, so that

$AB$ goes to $DA$
$DC \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \,  CB$

then each of the $16 \times  16 $ boards is divided into four equal $8 \times  8$ parts and each of these is moved around in the same way (within the $ 16 \times 16$ board). Then each of the $8 \times  8$ boards is divided into four $4 \times 4$ parts and these are moved around, then each $4 \times 4$ board is divided into $2 \times  2$ parts which are moved around, and finally the squares of each $2 \times  2$ part are moved around. What numbers end up on the main diagonal (from the top left to bottom right)?
To solve this problem, we need to understand how the numbers on the board are rearranged through a series of transformations. We will use induction to show that after all the transformations, the numbers on the main diagonal (from the top left to the bottom right) are the same as the numbers on the other main diagonal (from the bottom left to the top right) of the original board.

1. **Base Case (n = 1):**
   For a \(2 \times 2\) board, the numbers are arranged as follows:
   \[
   \begin{array}{cc}
   1 & 2 \\
   3 & 4 \\
   \end{array}
   \]
   After the transformation, the numbers are rearranged as:
   \[
   \begin{array}{cc}
   4 & 3 \\
   2 & 1 \\
   \end{array}
   \]
   The main diagonal (from top left to bottom right) now contains the numbers 4 and 1, which are the same as the numbers on the other main diagonal (from bottom left to top right) of the original board.

2. **Inductive Step:**
   Assume that for a \(2^n \times 2^n\) board, the main diagonal after all transformations contains the numbers from the other main diagonal of the original board. We need to show that this holds for a \(2^{n+1} \times 2^{n+1}\) board.

   Consider a \(2^{n+1} \times 2^{n+1}\) board. After the first transformation, the board is divided into four \(2^n \times 2^n\) quadrants, and each quadrant is moved as follows:
   \[
   \begin{array}{cc}
   A & B \\
   C & D \\
   \end{array}
   \]
   becomes
   \[
   \begin{array}{cc}
   D & A \\
   C & B \\
   \end{array}
   \]
   where each quadrant is a \(2^n \times 2^n\) board.

   By the inductive hypothesis, each \(2^n \times 2^n\) board will have its main diagonal containing the numbers from the other main diagonal of the original \(2^n \times 2^n\) board. Therefore, after the first transformation, the top left quadrant (which was originally the bottom right quadrant) will contain the bottom half of the other main diagonal, and the bottom right quadrant (which was originally the top left quadrant) will contain the top half of the other main diagonal.

3. **Subsequent Transformations:**
   Each subsequent transformation within the \(2^n \times 2^n\) quadrants will follow the same pattern, ensuring that the main diagonal of each quadrant contains the numbers from the other main diagonal of the original quadrant.

   Therefore, after all transformations, the main diagonal of the \(2^{n+1} \times 2^{n+1}\) board will contain the numbers from the other main diagonal of the original board.

By induction, this holds for all \(n\). Thus, for the \(32 \times 32\) board, the numbers on the main diagonal (from the top left to the bottom right) will be the same as the numbers on the other main diagonal (from the bottom left to the top right) of the original board.

The final answer is the numbers on the other main diagonal of the original board, which are \( \boxed{ 32, 63, 94, \ldots, 993, 1024 } \).