Hmm, probably a fault in my initial assumption then. Basically, I
think 666 is the best you can get assuming you use one drop-off point. The table should hopefully make things more clear.
A | 667 | B |
3000 | 0 | 0 |
2000 | 333 | 0 |
1000 | 666 | 0 |
0 | 999 | 0 |
0 | 0 | 666 |
Note: sorry I suck at formatting in bbcode D:
Basically, what I'm doing is grabbing 1k of apples, shipping them to the point whilst eating 1 per km, then driving back to A and not eating any apples because he has none on him atm (this is legit right?). You'll see that using 666 as the drop-off yields the same result, basically because these two numbers surround 666.6 recurring, the ideal number to ensure that you have 1000 apples at the drop off point. There's a bit more explanation to why I aimed to get 1000 apples at the drop off point (might be obvious to some of you), but it's redundant anyway if you've beaten 666 kamil =\. Mind sharing what you've got atm?
EDIT: Also works for 333.3 recurring, i.e. 334 and 333. Relies on the same principle really, but using these two numbers leaves 2k at the drop off, which ultimately gives the same answer I got above.