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.
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.