Escape from Monster

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?




Similar Logic Riddles

Find the next number in the series

12, 20, 40, 72, 116, 172 ?

Asked by Neha on 19 Oct 2025


A farmer went to a market and bought a wolf, a goat, and a cabbage. On his way home, the farmer came to the bank of a river and rented a boat. But crossing the river by boat, the farmer could carry only himself and a single one of his purchases: the wolf, the goat, or the cabbage. If left unattended together, the wolf would eat the goat, or the goat would eat the cabbage. The farmer’s challenge was to carry himself and his purchases to the far bank of the river, leaving each purchase intact. How did he do it?

Asked by Neha on 21 May 2025

A thief is convicted in Mexico. He gets the death penalty. The judge allows him to say the last sentence to determine how the penalty will be carried out. If the thief lies, he will be hanged, if he speaks the truth he will be beheaded. The thief tells the last sentence and to everybody's surprise some minutes later he is set free because the judge cannot determine his penalty. What did the thief say?

Asked by Neha on 07 Sep 2024


John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?

Asked by Neha on 18 Oct 2024

Find The Next Number in the series:

12 13 15 17 111 113 117 119 123 ?

Asked by Neha on 01 Dec 2023

why number 8549176320 is one of a kind?

Asked by Neha on 17 Apr 2023


John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.

John and Jill possess many padlocks but neither one of them has the other key.

Can you find a way John can send the ring to Jill safely?

Asked by Neha on 03 Dec 2025

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

People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?

Asked by Neha on 13 Mar 2024


Once upon a time, there was a castle on a square island. The entire island was surrounded by a 14m wide trench. The Romans had wanted to invade the castle and had brought a few wooden planks along with them to facilitate themselves in crossing the moat. The planks were however found to be only 13m long.

The Romans still managed to cross the trench. How did they do it?

Asked by Neha on 02 May 2023

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