Castles in a line

A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

Castles in a line




Similar Logic Riddles

A man embarked on a questionnaire game. He kept asking the same question to whomever he found. The answer each time was different.

Can you guess what the question was?

Asked by Neha on 22 Apr 2023


The day after tomorrow will be three days before Tuesday. Can you find out what is today?

Asked by Neha on 26 Apr 2023

In The 1st month of this year(the year 2013), I noticed that the date 13-1-13 (13 January 2013) is special.

This date is special as:

Date * Month = Year.

Can you figure out which year of this century has a maximum number of such dates?

Asked by Neha on 14 Aug 2024


A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

Asked by Neha on 26 Sep 2024

Three ants are sitting at the three corners of an equilateral triangle. Each ant starts randomly picks a direction and starts to move along the edge of the triangle. What is the probability that none of the ants collide?

Asked by Neha on 05 Sep 2021

A number with an interesting property:

When I divide it by 2, the remainder is 1.
When I divide it by 3, the remainder is 2.
When I divide it by 4, the remainder is 3.
When I divide it by 5, the remainder is 4.
When I divide it by 6, the remainder is 5.
When I divide it by 7, the remainder is 6.
When I divide it by 8, the remainder is 7.
When I divide it by 9, the remainder is 8.
When I divide it by 10, the remainder is 9.

It's not a small number, but it's not really big, either.
When I looked for a smaller number with this property I couldn't find one.

Can you find it?

Asked by Neha on 21 Nov 2024


The host of a game show offers the guest a choice of three doors. Behind one is an expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Asked by Neha on 06 May 2023

Jack was having a candle light dinner with his girlfriend. Suddenly a cold gush of wind entered through the open window and three of the ten candles were extinguished. Assuming that none of the other candles were extinguished.

How many candles are they left with in the end ?

Asked by Neha on 12 Dec 2020

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

Asked by Neha on 03 Mar 2023


You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).

How will you do it?

Asked by Neha on 12 May 2024

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