Postman with an Old Motorbike
A postman needs to deliver several packages in four different cities located in a line as above, and get back to the post office.
However, because his motorbike is old, he can only travel 20 miles with a full tank of fuel. He may, however, fill up his fuel tank in any city. For example, he would plan the trip below. This trip takes 5 stops but is not feasible because he cannot travel 40 miles from city D to the office without stopping.
In a feasible trip, what is the minimum number of times he would need to stop?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
First stop at B. Fill tank. Second stop at D. Fill. Third stop at C. Fill. Fourth stop at A. Fill. 5th stop at office.