Comments on:

By: MM

MM — Sat, 30 Jan 2010 13:36:48 +0000

Gnoblar: its impossible to find the best route this way. Or maybe there is, you would probably win a Noble prize for inventing that.

Anonymous: that would probably take more time to compute than doing the actual pathfinding:)

By: Anonymous

Anonymous — Sat, 30 Jan 2010 04:46:03 +0000

You could use differentials to calculate the exact distance from which the bot should use caching to maximize performance. Although it would be hard to find the time/complexity functions for both algorithms.

Eg,

f(z) = g(x) + h(y)

f,g,h //time/complexity functions of distance.
z = x + y //full distance to objective
x //distance without caching
y //distance with caching

find minimal value of function f and its optimized
and btw, its SCIENCE!

By: Tenshi

Tenshi — Fri, 29 Jan 2010 22:10:01 +0000

Two more days to go. Boy oh boy!

By: Wolfmilf

Wolfmilf — Fri, 29 Jan 2010 20:48:54 +0000

@FinDude

Put it down? It must be done before the end of the month. Update deadline.

By: FinDude

FinDude — Fri, 29 Jan 2010 14:55:21 +0000

Now just put it down and move on.
In any case don’t even think about all the ways you can optimize
and modify it.

By: Gnoblar

Gnoblar — Fri, 29 Jan 2010 14:43:17 +0000

Maybe the bot should work backkwards? As in, he finds his waypoints from his target to him, not from him to his target. That might be a little slow actually… And confusing for the bot.

By: Marte

Marte — Fri, 29 Jan 2010 13:20:00 +0000

some sort of quad-tree of paths ?