# How can he transport all 3 gold bars in one go without risking the bridge?

+1 vote
106 views

A thief is on the run after stealing 3 large gold bars.

The police are in hot pursuit.

He has 3 gold bars in his arms – each weighing 5 kg each.

The problem arises when he comes across a mile long, fragile bridge which can only support 100kg.

The thief weighs 90kg.

How can he transport all 3 gold bars in one go without risking the bridge?

posted May 30, 2017

If juggling is the answer here, then the person who made this question has no idea how physics works. While Tossing the golden bars or even while walking Dynamic loads come into play and that can easily cross 100 kg threshold at many instances.

He will Juggle them.
At any one point, only 2 gold bars will be acting on the bridge, the third being airborne, meaning a maximum of 100 kg total at
any given time.

Similar Puzzles

A one armed surgeon with a hand wound needs to operate on three patients. The surgeon only has two gloves.
How can he operate on the three patients without risking exchange of fluids? (Remember he only has one arm so he only needs to wear one glove at a time.)

A group of four people wants to cross bridge. It is dark, and they have to light the path with a torch. No more than two people can cross the bridge simultaneously, and the group has only one torchlight. It takes different time for the people in the group to cross the bridge:

A crosses the bridge in 1 minute,
B crosses the bridge in 2 minutes,
C crosses the bridge in 5 minutes,
D crosses the bridge in 10 minutes.

How can the group cross the bridge in 17 minutes?

A prison has 23 prisoners in 23 different cells. The prisoners have no way to communicate with each other in any way from their cells. There is another room, the rec room, that has two switches on the wall (A and B). The switches have on and off positions but they start in an unknown position.

Prisoners are randomly taken to and from the rec room one at a time. They must change the position of only one of the two switches each time they go to the room. At any point a prisoner can yell out, "Every prisoner has been here!" If the prisoner is correct that all of the prisoners have visited the rec room, then they all go free. If they aren't correct then they are all executed.

Before they start they are given one planning session during which they can discuss a method to win the game.
What method can they use to ensure they all go free?