Puzzle: A group of 25 tourists had to cross a wide and deep river with no bridge in sight. They notice two 10-year-old boys playing in a rowboat by the shore. The problem is that the boat is so small, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat?
Let’s solve this problem step-by-step.
- The initial situation is:
- At first, the two boys will take the boat to the other side, as shown in the figure.
- Then, one boy will return with the boat, and one boy will stay at the other end.
- When the boy returns, then one of the tourists will row the boat across the river.
- When the tourist will reach the other end, the boy there will come back with the boat.
Hence, for 1 tourist to cross the river, the boat needs to be rowed 4 times. So, for 25 tourists, the boat needs to be rowed 100 times from shore to shore. Also, for n tourists in total 4n tourists are required.
- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
- Puzzle 2 | (Find ages of daughters)
- Puzzle 3 | (Calculate total distance travelled by bee)
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Puzzle 13 | (100 Prisoners with Red/Black Hats)
- Puzzle 5 | (Finding the Injection for Anesthesia)
- Puzzle 6 | (Monty Hall problem)
- Puzzle 7 | (3 Bulbs and 3 Switches)
- Puzzle 8 | (Find the Jar with contaminated pills)
- Puzzle 9 | (Find the fastest 3 horses)
- Puzzle 10 | (A Man with Medical Condition and 2 Pills)
- Puzzle 11 | (1000 Coins and 10 Bags)
- Puzzle 12 | (Maximize probability of White Ball)
- Puzzle 14 | (Strategy for a 2 Player Coin Game)
- Puzzle 15 | (Camel and Banana Puzzle)
- Puzzle 17 | (Ratio of Boys and Girls in a Country where people want only boys)
- Puzzle 16 | (100 Doors)
- Puzzle 18 | (Torch and Bridge)
- Puzzle 19 | (Poison and Rat)
- Puzzle 20 | (5 Pirates and 100 Gold Coins)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.