Soapbox

Oh, I give up trying to post the rest of the 'spec'; useless submission thing says the text is too long, even though it's only 48 lines.

> anyone know anything about recursive calculations

In what sense?  Recursion usually refers to a routine that's called from within that routine.  You usually need some means of determining when to stop recursing or you disappear up your own fundament.  Or the stack overflows...

blimey it'll be 'Divide by Zero'  time next

What do you want to know about recursion Phil? And (I ask worriedly), why? 

(A route that followed a Sierpinski Curve could be fun though).

This thread brought back some memories for me!

I actually bought a route card program called TrailMate or something like that, must have been the only one as a quick google does not bring up anything but dating agencies .

It worked by entering the grid reference of each point along your route with HASL and it worked out the time for each leg etc taking into Naismith's rule etc. After all the hard work you print off a master route card, a team route card and also an abridged version to leave behind for the Emergency Services (just in case). You could have downloaded a free version which was fully functional except for printing, you had to pay £20 or so to get a licence which allowed you to print.

Now I just use Memory Map to make my routes and just press the route card button to create a route card!