15 Cave Riddle

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

15 Cave Riddle




Similar Riddles

I live in a bowl. I can swim. I have a tail. I also have fins and big eyes. What am I?

Asked by Neha on 01 Nov 2025


In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?

Make Two Square

Asked by Neha on 14 May 2021

I left my campsite and hiked south for 3 miles. Then I turned east and hiked for 3 miles. I then turned north and hiked for 3 miles, at which time I came upon a bear inside my tent eating my food! What colour was the bear?

Asked by Neha on 03 Jul 2025


You can see it everyday, But cannot touch it at will. What is it?

Asked by Neha on 17 May 2021

Can you name four days which start with the letter 'T'?

Asked by Neha on 20 Nov 2024

What is both possible and impossible at the same time?

Asked by Neha on 15 Apr 2022


Baseball bat and ball cost $100. If the bat cost $99 more than the ball, what is the cost of each?

Asked by Neha on 23 May 2021

What can run but never walk, have a mouth that never speaks, have a head that never weeps, and have a bed but never sleeps?

Asked by Neha on 05 Sep 2025

What is the next number in the series?

15 29 56 108 208 ?

Asked by Neha on 27 Dec 2024


What am I?

Asked by Neha on 10 Apr 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