Two men play a dice game involving roll of two standard dice. Man X says that a 12 will be rolled first. Man Y says that two consecutive 7s will be rolled first. The men keep rolling until one of them wins.
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
Four friends are sitting on a tree. Each one of them is wearing a hat. They don't know which coloured hat are they wearing but they do know that two of them have green hats and two of them have orange hats.
Adam is sitting on the top branch and he can see the hats of Billy and Cyrus. Billy is sitting on a branch above Cyrus and he can see Cyrus hat. Duke is sitting at the base of the tree. Branches are covering him fully and no one can see his hat.
Now they are not allowed to look upwards. Who do you think will shout the colour of his hat first?
Seven Robbers robbed a bank and hide the coins in a lonely place.
They decide to divide the money equally the next morning. Two greedy robbers decided to cheat the others and reach the place at night. They equally divided the coins between them, one coin left. So they called another robber and then they decided to divide equally among the three. Sadly again one coin left. The same thing happened to the 4th 5th and the 6th robber.
However, when the 7th robber reached in the morning, they can divide the coins equally.
A man is shown a portrait painting. He looks closely, then tells, “Brothers and sisters have I none, but that man’s father is my father’s son!†Who is the man in the portrait?
There's a day, that comes around once a year.
To celebrate the man, you hold dear.
He gave you life, love and will pick you up if you fall.
When it comes to guys like him, He's the best of all.
Who is he?
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