Horse Race in Mexico

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

Horse Race in Mexico




Similar Riddles

What is red and smells like blue paint?

Asked by Neha on 22 Jul 2025


Analyze and find the missing item in the sequence:
16, 06, 68, 88, __, 98

Asked by Neha on 05 Apr 2025

Solve The below Equation:

ALFA + BETA + GAMA = DELTA

Asked by Neha on 20 Jul 2023


What question can you never answer yes to?

Asked by Neha on 09 May 2022

During an interview, the interviewer ordered hot coffee for the candidate to relieve the stress. The coffee was kept before him. After a minute, the interviewer asked him, 'What is before you?' He replied 'Tea'.

The candidate was selected immediately. Why?

Asked by Neha on 16 Jun 2024

A murder has been committed in a house. You are a detective and have to find out the murderer.

You investigate by asking three questions to each of the six suspects. Out of those six suspects, four are liars. It is not necessary that they speak everything a lie. But in their answers, there must be at least one lie. One of the six is the murderer.

There are eight rooms in the house in which the murder has been committed: Kitchen, Living Room, Bathroom, Garage, Basement, 3 Bedrooms.

At the time of the murder, only the murderer was present in the killing room. Any number of people can be present in any of the other rooms at the same time.

Can you identify the murderer and the four liars? Also, can you find out who was in which room?

The responses of all the suspects are mentioned below.

Joseph:
Peter was in the 2nd bedroom.
So was I.
David was in the bathroom.

Mandy:
I agree with Joseph that David was in the bathroom and Peter was in the 2nd bedroom.
But I think that Joseph was in the living room, OH MY GOD!

Peter:
Mandy was in the kitchen with Christopher.
But I was in the bathroom.

David:
I still say Peter was in the 2nd bedroom and Jennifer was in the bathroom.
Joseph was in the 1st bedroom.

Jennifer:
Peter was in the bathroom with Christopher.
And Mandy was in the kitchen.

Christopher:
David was in the kitchen.
And I was in the 2nd bedroom with Peter.

PS: The corpse was found in the Living Room.

Asked by Neha on 22 May 2023


You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

Asked by Neha on 03 Jun 2025

Considering the below equation:

V + II - VI = 10
IV - X + VIII = 20
IV - VII + VI = 30

Then, I + II + III = ?

Asked by Neha on 15 Nov 2024

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

Asked by Neha on 05 May 2024


In a chess board, the queen piece can move horizontally, vertically and diagonally freely. The picture represents the same.Can you place 8 queens on the board in a manner that none of the queens can attack each other?

Chess Board Puzzle

Asked by Neha on 10 Oct 2025

Hot Articles

Amazing Facts

No Solution

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