dailyprogrammer challenge. ASCII drawing of a hilbert curve using given degree.
Challenge:
Today we're going to set a more open-ended challenge. First, let's look at what a space-filling curve is.
A space-filling curve[2] is a specific type of line/curve that, as you recreate it in more and more detail, fills more and more of the space that it's in, without (usually) ever intersecting itself. There are several types of space-filling curve, and all behave slightly differently. Some get more and more complex over time whereas some are the same pattern repeated over and over again.
Your challenge will be to take any space-fulling curve you want, and write a program that displays it to a given degree of complexity.
Formal Inputs and Outputs
Input Description
The input to this challenge is extremely simple. You will take a number N which will be the degree of complexity to which you will display your fractal curve. For example, this image[3] shows the Hilbert curve shown to 1 through 6 degrees of complexity.
Output Description
You must print out your own curve to the given degree of complexity. The method of display is up to you, but try and stick with the ASCII theme - for example, see below.