- // Yes, this is smart (and odd). You may all praise me now.
- // After looking over how others did this, with tons of ugly
- // maths combined with lots of recursion, i decided to approach
- // this in a very different way. To cut down on the recursion,
- // as users may be able to trigger this command, the algorithm
- // renders the map 'backwards' without recursion after it has
- // correctly placed the servers into the lines.
+ // Ok, prepare to be confused.
+ // After much mulling over how to approach this, it struck me that
+ // the 'usual' way of doing a /MAP isnt the best way. Instead of
+ // keeping track of a ton of ascii characters, and line by line
+ // under recursion working out where to place them using multiplications
+ // and divisons, we instead render the map onto a backplane of characters
+ // (a character matrix), then draw the branches as a series of "L" shapes
+ // from the nodes. This is not only friendlier on CPU it uses less stack.
+