Sweet & very intelligent katty has 8 puppets(Jane Bird Barbie Angel Colleen Nora Lass Missy).
All puppets are of different size. She arrange all puppets to face towards the guest and tell the guess the following clues :
* Jane has three puppets bigger on its left side
* Bird has two puppets smaller on its left side
* Barbie has one puppet bigger on its right side
* Angel has two puppets smaller on its right side
* Colleen has one puppet bigger on its left side
* Nora has one puppet smaller on its left side
* Lass has four puppets bigger on its right side
* Missy has three puppets smaller on its right side
Also some puppets are inside the bigger puppets.
Assuming you are the guest , can you tell the katty how the puppets are arranged ?
While preparing the table for dinner, wife came up with an idea to tease his mathematician husband. She asked her husband to pick nine toothpicks and make ten without breaking any toothpick.
The husband was also smart and did it within seconds. How ?
Jack have ten pairs of black socks, eight pairs of white socks and seven pairs of green socks. Everything is mixed in a draw. As there is no light he were not able to identify the colour of the socks. How many of the socks did he want to take to match one pair
100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?
A small town is visited by an ice-cream truck every day. On the first day of February, the truck visits as usual and 5 children, one from each of the first 5 houses on the street buys an ice cream that is of the different flavor from each other along with a completely different topping.
Go through the details below and find out which child lives in which house and bought which ice-cream flavor with which topping:
1. Jim lives between the child who bought the Raspberry topping and the child who bought mango ice cream.
2. Joyce, whose house has an even number, bought the cherry topping. Nancy does not live next to Joyce.
3. The blackcurrant ice cream had no topping.
4. The child who lives in house number 2 had the butterscotch ice cream. The child in house number 3 did not have chocolate ice cream.
5. Mike had banana ice cream. He hates banana cherry.
6. The child who had the cashew topping lives in house number 5. Dustin does not live in house number 4.
Please note that the odd numbered houses and the even numbered houses are located on the exactly opposite sides of the street.
There are three boxes which are labeled as Rs100, Rs150, and Rs200. One box contains two notes of Rs. 50. The second box contains one note of Rs50 and one note of Rs100 The third box contains two Rs. 100 notes. All boxes are labeled incorrectly.
What is the minimum number of boxes you must check in order to label all boxes correctly?
A pack of cards has 40 cards. You are blindfolded. Out of 40, 25 cards are facing down while 15 are facing up. You have been asked to divide this pack of cards into two decks - so that each deck contains an equal number of face-up cards. Remember, you are blindfolded.
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.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
