You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)
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?
Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.
How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?
Three friends decide to distribute the soda cans they had among them. When all of them had drunk four cans each, the total number of cans that remained was equal to the cans each one of them had after they had divided the cans.
Can you calculate the total number of cans before distribution?
One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.
I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?
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.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.