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?
In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.
A merchant was able to escape the kingdom without harming the shooter. How?
Find a 9-digit number, which you will gradually round off starting with units, then tenth, hundred etc., until you get to the last numeral, which you do not round off. The rounding alternates (up, down, up ...). After rounding off 8 times, the final number is 500000000. The original number is commensurable by 6 and 7, all the numbers from 1 to 9 are used, and after rounding four times the sum of the not-rounded numerals equals 24.
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.
