Chess Tournament

A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?




Similar Riddles

How can you take 2 from 5 and leave 4?

Asked by Neha on 03 Apr 2022


Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.

Asked by Neha on 01 Oct 2024

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

Asked by Neha on 17 May 2021


You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.

What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?

Asked by Neha on 28 Apr 2023

There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

Asked by Neha on 03 Oct 2023

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

Asked by Neha on 24 Mar 2021


John bought 150 chocolates but he misplaced some of them. His Father asked him how many chocolates were misplaced.
He gave the following answer to him:
If you count in pairs, one remains
If you count in threes, two remain
If you count in fours, three remain
If you count in fives, four remain
If you count in sixes, five remain
If you count in sevens, no chocolate remains.

Can you analyze the statements and tell us how many chocolates were lost?

Asked by Neha on 22 Dec 2024

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?

Asked by Neha on 09 Aug 2024

Replace the (?) with the correct mathematical signs to make the expression equal to 59.

18 ? 12 ? 4 ? 5 = 59

Asked by Neha on 06 Mar 2024


How many times can you subtract the number two from the number fifty?

Asked by Neha on 12 Mar 2022

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