

Get from A to B via the blue lines, visiting every black dot once and only once.

is to make an ant colony optimisation program to find the shortest route around TSP problems like this.
So give me a half a year and I'll find your solution for you.
( ,
Sat 17 Dec 2005, 3:06,
archived)
So give me a half a year and I'll find your solution for you.

I ended up using a similar system to try and solve the the trianglulated graph strippification problem to a empirically testable heuristic (rendering fps of the stripped mesh solution).
Great stuff... it landed me a job at pandemic studios.
( ,
Sat 17 Dec 2005, 3:15,
archived)
Great stuff... it landed me a job at pandemic studios.

"Making the world's supervirus problems a reality"?
( ,
Sat 17 Dec 2005, 3:16,
archived)