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

There is a basket full of hats. Three are white and two are black. Three men, Tom, Tim, and Jim, each take a hat out of the basket and put it on their heads without seeing the hat they selected or the hats the other men selected. The men arrange themselves so Tom can see Tim and Jim’s hats, Tim can see Jim’s hat, and Jim can’t see anyone’s hat. Tom is asked what color his hat is and he says he doesn’t know. Tim is asked the same question, and he also doesn’t know. Finally, Jim is asked the question, and he does know. What colour is his hat?

Asked by Neha on 06 Jun 2025


In a family supper, a grandfather, a grandmother, two fathers, two mothers, four children, three grandchildren, one brother, two sisters, two sons, two daughters, one daughter-in-law, and one mother-in-law need to sit at a table.

There are only seven chairs available at the place. How many more chairs do they have to borrow so that everyone can sit down together for the suppers if everybody requires a separate chair?

Asked by Neha on 09 Nov 2024

You have 10 balls with you. A friend of yours out of nowhere asks you to place those ten balls in five lines such that each of the lines has exactly 4 balls on them. He needs to check your intelligence. Prove him by doing the task.

Asked by Neha on 17 Mar 2023


There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?

Asked by Neha on 24 Dec 2025

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

Asked by Neha on 29 Oct 2023

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


Transform the word THINK into BRAIN while changing only one letter at a time in a manner that each of the word in the process is a real word!!!

Asked by Neha on 16 Feb 2023

You have 1023 apples and 10 bags. You have to distribute these apples in these 10 bags in any way you choose. But when I ask for a certain number of apples you have to give them in terms of bags without transferring the apples from other bags. How do you distribute the apples?

Asked by Neha on 25 Jan 2021

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

Asked by Neha on 09 Apr 2023


What number does the below three word/phrase identify and why?
1. Deck
2. Year
3. Singing in the Rain

Asked by Neha on 21 Feb 2024

Hot Articles

Amazing Facts

Challenging

There is a cryptic organization called Cicada 3301 that posts challenging puzzles online, possibly to recruit codebreakers and linguists.