Strategy puzzles




Easy Strategy

Hundred tigers and one sheep are put on a magic island that only has grass. Tigers can live on grass, but they want to eat sheep. If a Tiger bites the Sheep then it will become a sheep itself. If 2 tigers attack a sheep, only the first tiger to bite converts into a sheep. Tigers don’t mind being a sheep, but they have a risk of getting eaten by another tiger. All tigers are intelligent and want to survive. Will the sheep survive?

Hint
Answer
Solution
Source: Common
Enable Like and Comment


Easy Strategy

A duck is swimming at the center of a circular lake. A fox is waiting at the shore, not able to swim, willing to eat the duck. It may move around the whole lake with a speed four times faster than the duck can swim. As soon as duck reaches the surface, it can fly, but not within the pond. Can the duck always reach the shore without being eaten by the fox?

Hint
Solution
Source: Technical Interview
Enable Like and Comment


Easy Strategy

100 prisoners are lined up and assigned a random hat, either red or blue. There can be any number of red hats. Each prisoner can see the hats in front of him but not behind. Starting with the prisoner in the back of the line and moving forward, they must each, in turn, say only one word which must be "red" or "blue". If the word matches their hat color they are released, if not, they are killed on the spot. They can hear each others answers, no matter how far they are on the line. A friendly guard warns them of this test one hour beforehand and tells them that they can formulate a plan where by following the stated rules, 99 of the 100 prisoners will definitely survive, and 1 has a 50/50 chance of survival. What is the plan to achieve the goal?

Hint
Solution


Easy Strategy

A traveler wants to go to the mystic. He meets a pair of twins at a fork in the road: one path leads to the jungle, the other to the mystic. One of the twins always says the truth, the other always lies. What yes/no question should he ask one of the twins to determine the path that goes to the mystic?

Hint
Solution
Source: Common
Enable Like and Comment


Easy Strategy

An Egg breaks only if dropped from above a threshold floor, within this 100 story building. Every time you drop the egg, it is counted an attempt. You are given two eggs, find an algorithm to deduce the threshold floor, with minimum number of attempts in worst case!

Hint
Answer
Solution
Source: Quant Interview
Enable Like and Comment




© BRAINSTELLAR