Quote:
Originally posted by lrutledge@Jul 30 2003, 08:01 PM
I'd like to know the answer to question number 3 also. I believe the question is what is the maximum value we should expect for a route length? With A* path finding algorithms you assign an "infinity" value to unused node's that is larger than the largest expected value (i.e. 32767).
Thanks,
Larry
|
that's what i meant:
3) what is the maximum cost to expect.
and now a general contest question:
4) can i participate with 2 scripts or it's only 1 script per user?
i mean this, becouse i can have 2 kind of scripts:
a) the perfect solution, take a long time
B) the quickest, imperfect one.
so depending on the input i could win with a) or B)....
it would be nice to submit 2 versions...