How expirienced is the traveling salesman? How long has he been doing it and how many places does he go? What kinds of goods does he sell? How heavy are those? How many of them has he carried at one time?
And what kinds of things do the computer scientists do with computers? do they design 3D topigraphical maps? Do they make antivirus software?
I don’t really know what kinds of things the computer scientists do or how that would come in handy for a race, but since the traveling saleman already travels to many places I’d give the win to the salesman
Also, is the race point-to-point? is it a track in a loop of some sort? is it a race around the entire planet?
The race is on a loop, you only pass each point one time. You get from the starting place and return there, passing at each point 1 time, what would be the shortest/fastest path? That’s the problem.
You can probably put weights on the fuel efficiency, based on the cargo weight, distance/speed he can drive (based on the experience and expected value for him), fueling stops, etc. Just add that to A* and some tinkering, I think you could make a good algorithm.
How expirienced is the traveling salesman? How long has he been doing it and how many places does he go? What kinds of goods does he sell? How heavy are those? How many of them has he carried at one time?
And what kinds of things do the computer scientists do with computers? do they design 3D topigraphical maps? Do they make antivirus software?
I don’t really know what kinds of things the computer scientists do or how that would come in handy for a race, but since the traveling saleman already travels to many places I’d give the win to the salesman
Also, is the race point-to-point? is it a track in a loop of some sort? is it a race around the entire planet?
The race is on a loop, you only pass each point one time. You get from the starting place and return there, passing at each point 1 time, what would be the shortest/fastest path? That’s the problem.
You can probably put weights on the fuel efficiency, based on the cargo weight, distance/speed he can drive (based on the experience and expected value for him), fueling stops, etc. Just add that to A* and some tinkering, I think you could make a good algorithm.