Cross the Bridge

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?




Similar Logic Riddles

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

Asked by Neha on 05 May 2024


You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

Asked by Neha on 30 Nov 2024

A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?

Asked by Neha on 22 Apr 2022


In a science lab, a petri dish hosts a healthy colony of yeast for an experiment. Now every minute, all the yeast cells divide into two. At noon, there was just a single cell of yeast and at 1:22, the Petri dish was half full. Can you calculate when the dish will be full of yeast?

Asked by Neha on 23 Jun 2021

In a guessing game, five friends had to guess the exact numbers of apples in a covered basket.
Friends guessed 22, 24, 29, 33, and 38, but none of the guesses was correct. The guesses were off by 1, 8, 6, 3, and 8 (in random order).

Can you determine the number of apples in a basket from this information?

Asked by Neha on 23 Mar 2024

Find the next number in the series below

21 32 54 87 131 ?

Asked by Neha on 16 Nov 2023


While handling a project, the landscaper is asked by the owner of the mansion that he wants four trees in front of his mansion that are exactly equidistant from each other.

How will he do it?

Asked by Neha on 20 Nov 2023

A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

Asked by Neha on 26 Sep 2024

A pregnant woman is preparing to name her seventh child. Her children's names so far are Dominique, Regis, Michelle, Fawn, Sophie, and Lara. What will she name her next child -- Jessica, Katie, Abby or Tilly?

Asked by Neha on 29 Mar 2023


Christina is older than Kareena and Karishma. Katrina is older than Karishma and younger than Kareena. If Kareena has a brother named John, who is older than Christina, who's the youngest?

Asked by Neha on 10 Jul 2024

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki