Riddle #568



Emily was sitting at her study table, home alone, on a cold and stormy night. Her parents had taken a flight earlier in the morning to Australia as her grandmother had passed away. She had wanted to follow her parents but she had an important English examination the next day which she could not miss. The storm was getting heavier by the minute and the wind was howling outside. All this noise made it very hard for her to concentrate. She was on the verge of dozing off when she was shaken alert by a sudden "THUD!" She dismissed it as a window which had been slammed shut by the wind. She tried to concentrate on her books when she heard faint footsteps. Emily got out of her room and looked around when suddenly, without warning, she was grabbed by the neck. She tried to scream but it came out as a mere whimper as the intruder was pressing hard against her throat with his arm. She tried to free herself from his grip but to no avail. "Give me all your money!" growled the man who had grabbed her from behind. "Th-there is none h-here! Please ll-let me go!" cried Emily. "Don't LIE TO ME!" screamed the increasingly agitated man. She felt the man strengthen his grip around her neck. She said nothing and a few seconds passed by in silence. Suddenly the phone rang which alerted both of them. "People will get suspicious if I don't answer the phone," said Emily, with a controlled voice. The intruder let her go. "Alright, but NO funny business, or ELSE!" said the nervous intruder. Emily walked toward the phone. She took a deep breath and calmed herself. She picked up the phone. "Hey Em! How's the revision going?" said the caller. "Hey Anna. Thanks for the call. Hey you know those Science notes I lent you last week? Well I really need them back. It would be a great help to me. It's an emergency, so if you could give me them tomorrow it would be great. Please hurry in finding the notes. I need to get back to my books now. Bye," Emily said. She hung up the phone. "It was wise of you not to say anything," said the intruder, although he was more than a bit confused by her conversation. "Now TELL ME WHERE THE MONEY IS KEPT!" screamed the thief. "It...it's...in my dad's room. The first room on the right. Third drawer," said Emily. "SHOW me!" said the man, and removed his grip around her neck. She took a big gulp of air and nearly fell. She swallowed hard and said a silent prayer. She walked slowly, in silence, toward her father's room. All of a sudden, they heard police sirens. The intruder froze in his footsteps. He ran to the nearest window and jumped out of it. Emily ran outside in time to see the intruder being escorted into the car. She saw Anna and she ran toward her and hugged her. "Smart kids," said the policeman. What had happened?
Emily had used the mute button during her conversation with Anna so that all Anna heard ws:"call...help...emergency...please hurry". Anna, sensing something was wrong, called the police and told them Emily's address. The police were able to come to Emily's house in time to catch the perpetrator.
94.48 %
46 votes

Similar riddles

See also best riddles or new riddles.


Passing second place

In the final stretch of a road race, you pass the 2nd-place runner right before crossing the finish line. What place do you finish in?
You finish in second place. You would have had to pass the first place racer to have finished in first place.
91.77 %
30 votes


The mystery of Cindy

The day before yesterday Cindy was 17. Next year she will be 20. How can this be?
The statement was made on January 1. Cindy's birthday is on December 31. She was 17 the day before yesterday (Dec 30). She was 18 yesterday. She will be 19 this year (Dec 31) and 20 next year.
93.98 %
42 votes


Brothers and sisters

You and a friend are standing in front of two houses. In each house lives a family with two children. "The family on the left has a boy who loves history, but their other child prefers math," your friend tells you. "The family on the right has a 7-year old boy, and they just had a new baby," he explains. "Does either family have a girl?" you ask. "I'm not sure," your friend says. "But pick the family that you think is more likely to have a girl. If they do have a girl, I'll give you $100." Which family should you pick, or does it not matter?
You should pick the house on the left. Specifically, there is a 2/3 chance that the family on the left has a girl, whereas there's only a 1/2 chance that the house on the right has a girl. This is a very counterintuitive riddle. It seems like there should always be a 1/2 chance that a given child is a girl. And in fact there is. The key word there is "given". Because we are not asking about a "given" child for the house on the left. We are asking about what could be either child. Whereas for the house on the right, we are asking about a "given" child...specifically, we're asking about the younger child. There are 3 possibilities for the children in the first house: Younger Older Girl Boy Boy Girl Boy Boy There is no "Girl, Girl" option because we know the house on the left has at least one boy. Since each of these 3 options is equally likely, and 2 of them have one girl, there is a 2/3 chance of there being a girl in the house on the left. For the house on the right, because we already know the older child is a boy, there are only two possibilities: Younger Older Girl Boy Boy Boy And as we can see, there is a 1/2 chance for the house on the right having a girl.
94.24 %
44 votes


Tiling Without Corners

You can easily "tile" an 8x8 chessboard with 32 2x1 tiles, meaning that you can place these 32 tiles on the board and cover every square. But if you take away two opposite corners from the chessboard, it becomes impossible to tile this new 62-square board. Can you explain why tiling this board isn't possible?
Color in the chessboard, alternating with red and blue tiles. Then color all of your tiles half red and half blue. Whenever you place a tile down, you can always make it so that the red part of the tile is on a red square and the blue part of the tile is on the blue square. Since you'll need to place 31 tiles on the board (to cover the 62 squares), you would have to be able to cover 31 red squares and 31 blue squares. But when you took away the two corners, you can see that you are taking away two red spaces, leaving 30 red squares and 32 blue squares. There is no way to cover 30 red squares and 32 blue squares with the 31 tiles, since these tiles can only cover 31 red squares and 31 blue squares, and thus, tiling this board is not possible.
93.84 %
41 votes


A Fox, a sheep, and a sack of hay

A farmer is travelling with a fox, a sheep and a small sack of hay. He comes to a river with a small boat in it. The boat can only support the farmer and one other animal/item. If the farmer leaves the fox alone with the sheep, the fox will eat the sheep. And if the farmer leaves the sheep alone with the hay, the sheep will eat the hay. How can the farmer get all three as well as himself safely across the river?
The farmer takes the sheep across the river, then returns back. The farmer takes the fox across the river. The farmer takes the sheep back to the first side of the river. The farmer leaves the sheep back on the first side of the river, and takes the hay to the other side. The farmer returns to the first side of the river. The farmer brings the sheep back to the second side.
93.70 %
40 votes


Painting the doors

In a new Engineering Hostels they have 100 rooms. Ankit Garg was hired to paint the numbers 1 to 100 on the doors. How many times will Ankit have to paint the number eight ?
20 times.
93.05 %
36 votes


Dead in Water and Glass

Romeo and Juliet are found dead in a small puddle of water, surrounded by broken glass. The apartment building they are found in is located next to the city's main train station. How did they die?
Romeo and Juliet are fish. A passing train rattled the shelf their tank was sitting on and knocked it off of the shelf. The tank broke and the fish died from being out of the water.
93.39 %
38 votes


Country hidden in the paragraph

What country is hidden in the paragraph below? As defendants, we deny all involvement in the unscrupulous dealings which have come to light in the recent government investigation.
93.70 %
40 votes


25 Horses

You have 25 horses. When they race, each horse runs at a different, constant pace. A horse will always run at the same pace no matter how many times it races. You want to figure out which are your 3 fastest horses. You are allowed to race at most 5 horses against each other at a time. You don't have a stopwatch so all you can learn from each race is which order the horses finish in. What is the least number of races you can conduct to figure out which 3 horses are fastest?
You need to conduct 7 races. First, separate the horses into 5 groups of 5 horses each, and race the horses in each of these groups. Let's call these groups A, B, C, D and E, and within each group let's label them in the order they finished. So for example, in group A, A1 finished 1st, A2 finished 2nd, A3 finished 3rd, and so on. We can rule out the bottom two finishers in each race (A4 and A5, B4 and B5, C4 and C5, D4 and D5, and E4 and E5), since we know of at least 3 horses that are faster than them (specifically, the horses that beat them in their respective races). This table shows our remaining horses: A1 B1 C1 D1 E1 A2 B2 C2 D2 E2 A3 B3 C3 D3 E3 For our 6th race, let's race the top finishers in each group: A1, B1, C1, D1 and E1. Let's assume that the order of finishers is: A1, B1, C1, D1, E1 (so A1 finished first, E1 finished last). We now know that horse D1 cannot be in the top 3, because it is slower than C1, B1 and A1 (it lost to them in the 6th race). Thus, D2 and D3 can also not be in the to 3 (since they are slower than D1). Similarly, E1, E2 and E3 cannot be in the top 3 because they are all slower than D1 (which we already know isn't in the top 3). Let's look at our updated table, having removed these horses that can't be in the top 3: A1 B1 C1 A2 B2 C2 A3 B3 C3 We can actually rule out a few more horses. C2 and C3 cannot be in the top 3 because they are both slower than C1 (and thus are also slower than B1 and A1). And B3 also can't be in the top 3 because it is slower than B2 and B1 (and thus is also slower than A1). So let's further update our table: A1 B1 C1 A2 B2 A3 We actually already know that A1 is our fastest horse (since it directly or indirectly beat all the remaining horses). So now we just need to find the other two fastest horses out of A2, A3, B1, B2 and C1. So for our 7th race, we simply race these 5 horses, and the top two finishers, plus A1, are our 3 fastest horses.
94.11 %
43 votes