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 Logic Riddles

Whats the next number in the below number sequence pattern.

Picture Pattern Riddle

Asked by Neha on 12 Nov 2025


During an experiment, a guy throws a bouncy ball from a 100 feet tall building. The ball has a specific characteristic. Every time it hits the ground, it bounces up halfway.

How many bounces do you think the ball will make before it comes to a stop ?

Asked by Neha on 24 Nov 2023

How many times in a given day, minutes and hour clock comes in a straight line ?

Asked by Neha on 03 Mar 2023


If eleven plus two equals one, what does nine plus five equal?

Asked by Neha on 28 Mar 2022

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

A pet show was happening in my locality. I went down along with my kids. In that show, I noticed that all except two of the entries were cats. All except two were dogs and all except two were Monkeys.

Can you find out how many of each animals were present in that pet show?

Asked by Neha on 04 Feb 2021


If,
9 * 8 * 7 = 65
8 * 7 * 6 = 50
7 * 6 * 5 = 37

Find
6 * 5 * 4 = ?

Asked by Neha on 05 Jul 2024

A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

Asked by Neha on 01 Apr 2024

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

Asked by Neha on 14 May 2025


Two old friends, Jack and Bill, meet after a long time.

Three kids
Jack: Hey, how are you, man?
Bill: Not bad, got married and I have three kids now.
Jack: That's awesome. How old are they?
Bill: The product of their ages is 72 and the sum of their ages is the same as your birth date.
Jack: Cool..But I still don't know.
Bill: My eldest kid just started taking piano lessons.
Jack: Oh, now I get it.

How old are Bill's kids?

Asked by Neha on 21 Apr 2021

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