top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

What will be your strategy to escape from the island safely?

0 votes
613 views

You are stuck on an island where you have nothing. You find four pieces of paper somewhere on the island.

What will be your strategy to escape from the island safely?

PS: No other resource is available to you on the island, neither can you build anything.

posted Aug 21, 2014 by Mohammad

Share this puzzle
Facebook Share Button Twitter Share Button LinkedIn Share Button

2 Answers

+1 vote

Nothing may be the name of a ship/boat and four pieces of paper help to have driving direction while driving the ship/boat.

answer Aug 22, 2014 by Salil Agrawal
0 votes

Answer:
Nothing is the name of a ship that has been docked near the coast. The four pieces of paper contains the map and directions that can be used by you while driving the ship.

answer Oct 9, 2017 by Mogadala Ramana



Similar Puzzles
+1 vote
What strategy could they use to ensure they will go free?

There is a prison with 100 prisoners, each in separate cells with no form of contact. There is an area in the prison with a single light bulb in it. Each day, the warden picks one of the prisoners at random, even if they have been picked before, and takes them out to the lobby. The prisoner will have the choice to flip the switch if they want. The light bulb starts in the Switched off position.

When a prisoner is taken into the area with the light bulb, he can say "Every prisoner has been brought to the light bulb." If this is true all prisoners will go free. However, if a prisoner chooses to say this and it's wrong, all the prisoners will be executed. So a prisoner should only say this if he knows it is true for sure.

Before the first day of this process begins, all the prisoners are allowed to get together to discuss a strategy to eventually save themselves.

What strategy could they use to ensure they will go free?

+1 vote
Strategy that yields the largest amount of mango's to be delivered to B.

Distance between the towns A and B is 1000 miles. There is 3000 mango's in A, and the mango's have to be delivered to B. The available car can take 1000 apples at most. The car driver has developed an addiction to mango: when he has mango aboard he eats 1 mango with each mile made. Figure out the strategy that yields the largest amount of mango's to be delivered to B.

+1 vote
What can the man do to escape from drowning ?

There is man locked up in a room, which has no windows or any way out except for a firmly locked door that can't be unlocked or destroyed by any means. There is an open tap at a corner of the room from which great amounts of water get into the room.

What can the man do to escape from drowning, if he only has a large rope and a bucket that can hold up to 5 liters of water?

0 votes
How the man manages to escape from the kingdom ?

Once there lived a king who did not allow anybody to leave the kingdom and any foreigners to enter in his kingdom. There was only one bridge that connected his kingdom with the outer world. A guard who was a sharpshooter was specially assigned for guarding the bridge. According to the orders, anyone moving outside should be killed and anyone coming to his kingdom should be sent back. To take rest, the guard used to sit inside his hut for 5 minutes and return back on the post. The bridge took a minimum of 9 minutes to pass.

Even then, a man was able to escape the kingdom without any kind of harm from the guard.

How the man manages to escape from the kingdom ?

0 votes
Suggest a strategy such that player A will always win, no matter how player B will play?

Suppose two player, player A and player B have the infinite number of coins. Now they are sitting near a perfectly round table and going to play a game. The game is, in each turn, a player will put one coin anywhere on the table (not on the top of coin already placed on the table, but on the surface of the table). And the player who places the last coin on the table will win the game. Given player A will always move first. Suggest a strategy such that player A will always win, no matter how player B will play?

...