Five lovely ladies(Sophia, Isabella, Madison, Emma and Olivia) planned a picnic.
They each buy one thing each for the picnic.
Sophia, Emma and Olivia got a drink : orange-Juice, apple-juice, and mango-juice.
Olivia got the drink with the same letter as the one in her first name.
Emma loves mango-juice.
The other two bring some food : chocolates and pizza.
Also Madison is allergic to cheese.
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?)
You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?
Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?
I can sizzle like bacon,
I am made with an egg,
I have plenty of backbone, but lack a good leg,
I peel layers like onions, but still remain whole,
I can be long, like a flagpole, yet fit in a hole.
See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.