ROSECODE 500
Dragon curve
The Dragon curve is a fractal curve obtained by repeatedly appending a rotated version of itself.
Here are the first 4 iterations of this curve:
At each iteration (starting at 4), this curve contains closed squares grouped in contiguous blocks.
For instance, at iteration 8 we have:
The number of squares in each group starting from the initial point of the curve are:
What is the number of squares in each group at iteration 15?
Answer format: comma delimited list
Example:
[My timing : 30 sec]
Here are the first 4 iterations of this curve:
At each iteration (starting at 4), this curve contains closed squares grouped in contiguous blocks.
For instance, at iteration 8 we have:
The number of squares in each group starting from the initial point of the curve are:
What is the number of squares in each group at iteration 15?
Answer format: comma delimited list
Example:
[My timing : 30 sec]