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?
I am working in a bus company. The company recently went under expansion and therefore there was not enough room for all the buses. As a result, twelve buses had to be stored outside.
If the company decides to expand the garage space by forty percent, enough space to accommodate the current buses will be created leaving enough space for twelve more buses if the need arises in future.
Can you calculate the number of buses that the company owns at present?
Two guards were on duty outside a barracks. One faced up the road to watch for anyone approaching from the North. The other looked down the road to see if anyone approached from the South. Suddenly one of them said to the other, "Why are you smiling?"
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
In one of the popular batman series movie "Batman Forever", there was a riddle that goes like "Tear me off and then scratch my head and I was red then and now I am back. Who am I?