In a particular village, only two barbershops exist.
The first shop has a handsome barber with a neat haircut who is handsomely dressed in clean clothes and is extremely humble with his body language. The place is clean and looks hygienic.
In the second shop, you can find a barber with shabby clothing. His hairs are weirdly cut and his clothes still have the stains from last night's dinner. The place is not clean as well and reeks a bit.
You visit the village for the first time and decide to get your haircut. Which barbershop will you like to go for that and why?
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 girl rode into a tourist spot out of the city on Thursday. She loved the place and decided to stay for a few days. She stayed for four days and then she left for back home on Thursday.
A man started to town with a fox, a goose, and a sack of corn. He came to a stream which he had to cross in a tiny boat. He could only take one across at a time. He could not leave the fox alone with the goose or the goose alone with the corn. How did he get them all safely over the stream?
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
There are 20 people in an empty, square room. Each person has full sight of the entire room and everyone in it without turning his head or body, or moving in any way (other than the eyes). Where can you place an apple so that all but one person can see it?
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.