All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Manaslu Trail (Posted on 2023-12-27) Difficulty: 3 of 5
Four monks from Tibet have crossed the border into Nepal, and are trying to reach safety in Dharapani by walking the 24 kilometers on the treacherous Manaslu Trail along the Dudh Khola. They are of differing ages and fitness, and walk at 8, 4, 3 and 2 kilometers per hour, respectively. When several people walk together, they walk at the speed of the slowest person.

Along the way there are 5 hiding places, one every 4 kilometers. These are the only places that they can safely stop to rest and eat. Each hiding place is so small that only one person can occupy it at a time, but a monk can stay there as long as desired. For religious reasons, a monk can enter or leave one of these hiding places, or reach the end of the trail, only on the exact hour. It is unsafe for any monk to stop and wait anywhere other than inside the hiding places or at the ends of the trail.

Because the trail passes through narrow gorges and dense forest it will be dark the entire time they are traveling, and because the trail is so narrow and steep they must use a light to keep from falling off. They have one large torch that two people walking together can use, and they have 9 candles that a single person can use. The torch is lit when they start, and will last 24 hours, but the candles last for only one hour each. The lama, the senior monk, who is the slowest walker, carries the torch and all of the candles. He will give the other monks only one candle at a time, and only at the start or at the hiding places.

What is shortest possible combined transit time for the four monks?

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolutionBrian Smith2024-01-01 15:47:57
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information