Flat 1 is named the first flat.
Flat 2 is named the second flat.
Flat 3 is named the third flat. And So On.....
A visitor decides to walk through all the flats, and he finds all the flats except flat 62.
Anmol later founds that the locals of the town have given it another name.
There is a river to cross using a river raft and there are eight people (father, mother, policeman, thief, 2 daughters and 2 sons). No one knows to operate the raft except the adults and also excluding the thief. Only two people can go in the raft at a time. The raft should keep coming back and forth in order to pick and drop the people.
Rules to be followed:
Father: the father cannot stay in the raft or outside the raft without the presence of the mother.
Mother: the mother cannot stay in the raft or outside the rat without the presence of the father.
Thief: the thief is not allowed to stay with any of the family members unless there is a policeman.
Policeman: the policeman can travel with anyone.
2 sons and 2 daughters: they are not allowed to travel in the raft without the presence of an adult. They cannot either travel in the presence of only thieves without the policeman. The sons cannot be with their mothers without their father's supervision. The daughters are not allowed to be there with their fathers without the supervision of their mothers. But the daughters and the sons can be left unsupervised (as long as the other rules are applied).
What is the sequence that the people should follow in order to cross the river through the raft keeping in mind all the rules?
The rules are applicable not only in the raft but also outside the raft.
There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.
Can you calculate the distance between the fourth and the first village ?
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.
