In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
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?
Can you count the number of blocks in the picture below?
Here is a mathematical expression that also secretly tells a movie name. What movie is that?
Below rebus represent famous DiCaprio movie. Can you name it?
A Car driver was heading down a street in Washington. He went right past a stop sign without stopping, he turned left where there was a 'no left turn' sign and he went the wrong way on a one-way street. Then he went on the right side of the road past a cop car. Still, he didn't break any traffic laws. Why not?
