I amnew to this forum. I saw this puzzle on internet. I liked it.
The distance between the towns A and B is 1000 miles. There is 3000 apples in A, and the apples have to be delivered to B. The available car can take 1000 apples at most. The car driver has developed an addiction to apples: when he has apples aboard he eats 1 apple with each mile made. Figure out the strategy that yields the largest amount of apples to be delivered to B.
Generalize the strategy for an arbitrary amount of apples.
The site did not give a solution. I have one but not sure if it is the best one. I will post my solution soon.
Question
Guest
Hello everyone,
I amnew to this forum. I saw this puzzle on internet. I liked it.
The distance between the towns A and B is 1000 miles. There is 3000 apples in A, and the apples have to be delivered to B. The available car can take 1000 apples at most. The car driver has developed an addiction to apples: when he has apples aboard he eats 1 apple with each mile made. Figure out the strategy that yields the largest amount of apples to be delivered to B.
Generalize the strategy for an arbitrary amount of apples.
The site did not give a solution. I have one but not sure if it is the best one. I will post my solution soon.
Imran
Link to comment
Share on other sites
28 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.