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

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

Asked by Neha on 07 Jan 2025


There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

Asked by Neha on 03 Oct 2023

A prisoner is told: "If you tell a lie, we will hang you and if you tell the truth, we will shoot you." What did the prisoner say to save himself?

Asked by Neha on 18 Oct 2021


In an office's desk, you find a unique method that shows the current day of the month. Two numbered cubes are used to depict the current date.

Can you find out the numbers on both the cubes so that each date can be mentioned using them?

Please note that you have to use both the cubes to display any date. Thus the 1st day must be represented by 01 and so on.

Asked by Neha on 14 May 2023

I am eight letters long - "12345678"
My 1234 is an atmospheric condition.
My 34567 supports a plant.
My 4567 is too appropriate.
My 45 is a friendly thank-you.
My 678 is a man's name.

What word am I?

Asked by Neha on 02 Dec 2024

A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

Asked by Neha on 29 May 2024


There is a family that live in a round house. The two parents go out for a movie and leave a babysitter to watch their son. They come back and the kid was not there. Some one kidnapped him. The maid said she was cleaning in a corner. The cook said he was making pizza. The babysitter said she was getting a board game. Who kidnapped him.

Asked by Neha on 16 Mar 2022

There is an exact a week gap between Christmas and New Year. Hence, It is obvious that the new year that comes right after Christmas comes on the same day of the week.

A Strange thing happened in the Year 1777. Christmas occurs on Wednesday and New Year on Monday. How is that possible?

Asked by Neha on 19 Dec 2025

There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

Asked by Neha on 03 Aug 2023


Complete the following series. It.s very logical:

1, 4, 5, 6, 7, 9, 11, __?

Asked by Neha on 02 May 2024

Hot Articles

Amazing Facts

Challenging

There is a cryptic organization called Cicada 3301 that posts challenging puzzles online, possibly to recruit codebreakers and linguists.