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 boy was locked in a room by some robbers. All that is in the room is a piano, a calendar, and a bed. The room is locked from the outside. What does he eat, drink, and how does he escape and get out?
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
In the city of Brain Teasers, 5% of people do not list their phone numbers. Now if we select random 100 people from the phone directory, then how many people selected will have unlisted phone numbers?
A crime was committed at baker street. Ibrahim Dakota who was shot in the stomach was the main suspect. Sherlock questioned the suspect. The conversation started as:
Sherlock: What's your story, Ibrahim?
Ibrahim: I was walking around baker street and suddenly a man from the back shot me. I ran as fast as I could to save my life".
Sherlock: That is enough (and ask the police to arrest him).
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.