A programming challenge

Well, we accept that with all the assumptions made, the path found is not necessarily going to be THE best one, right?

I remember reading there were quadratic algorithms to find a path within 5-10% of the best solution to traveling salesman problem. You might want to look into that.

Or you could just implement greedy algorithm. Find the quest with the least cost, complete it, see where it lands you, repeat. That wouldn't be too difficult.

I like that idea, the 'greedy algorithm'
1. sort all quest in each area by 'cost' as defined above with the cheapest first.
2. run through one area, calcuate total cost for area.
3. add in travel cost between areas, etc.

Hmm, sounds interesting.