We do not know where this puzzle originated from. If you have any information, please let us know via email.
Alice secretly picks two different integers by an unknown process and puts them in two envelopes. Bob chooses one of the two envelopes randomly (with a fair coin toss) and shows you the number in that envelope. Now you must guess whether the number in the other, closed envelope is larger or smaller than the one you have seen.
Is there a strategy which gives you a better than 50% chance of guessing correctly, no matter what procedure Alice used to pick her numbers?
There are 2 wizards and each of them has infinitely many hats on his head. Every hat has 50-50 chance to be white or black, and the wizards can see the hats of the other person, but not their own. Each wizard is asked to identify a black hat on his head without looking, and they win if both succeed to guess correctly. If the wizards are allowed to devise a strategy in advance, can they increase their chance of winning to more than 25%?
Last week we found out that Puzzle Pranks Co. have invented a new type of puzzle – Rubik’s Chess. The goal is simple – you get a scrambled cube with various chess pieces on its sides, and you must unscramble it so that on each side there is one mated King, assuming the kings
We are usually good with this type of puzzles, but we spent our entire weekend trying to solve this one without any success. We even started wondering if it can be actually solved, so decided to share it with you and see if you can help us figure that out.
Below you can see the way the cube looks when seen from 8 different angles:
Remark: The orientations of the pieces are irrelevant to the final solution, i.e. they don’t need to be consistent on each side.
Two politicians go to a bar and order two glasses of vodka on the rocks. The first politician quickly empties his glass, then orders a second one, a third one… The second politician patiently drinks his own vodka, but about 20 minutes later, he drops down dead. The police discovered that the barman tried to assassinate both politicians, but how come the second one died and the first one lived?
One early morning, a group of friends meets in their favorite café.
Ash, the biggest in the group, remarked :
“Must have been millions of years since we were all together, uh?”
Affie, who was wearing her brand new elephant pants, nodded. Anthony kept on complaining about the weather back home.
“Yeah, I am glad to be here with you, it is so cold at my place!”
Eugenie, who was saddened by the loss of a friend, was looking at Samuel and Namur, who were arguing about the possible future election of Donald Trump.
“These two are really inseparable”, she said to herself.
Octavia, the smallest among her friends, stood and spoke :
“Guys, I have a surprise for you! We’re going to the opera tonight!”
The waiter, waiting for the orders, wondered why these customers reminded him of something. But all of a sudden, he said:
“Ladies and gentlemen, may I suggest some sliced bread with butter, slices of cheese and ham? We also have croissants and other pastries. And for drinking, is coffee fine? We also have tea, of course, and orange and apple juice for you.”
Which is this group of friends, and what came to the waiter’s mind?
You have a jar filled with water and a glass. If you pour some water into the glass and place a cork in it, the cork will float towards the edges of the glass. What is the easiest way to make the cork float towards the center?
You buy a bottle with a letter from the merchant, the merchant tells you that when you drink the liquid in the bottle it grants you eternal life, he supposedly deciphered this from the letter.
After you get home you decide to study the letter if it really says what the merchant told you, can you figure out if the bottle really grants eternal life?
You come to a fork in the road.
To the left is an empty well made from stone.
On the right is a pirate’s buried treasure.
Ahead you only see a tall straight tree.
The night is dark with only a dying moon in the sky.
Source: Puzzling StackExchange
On a standard 8×8 chessboard there are 7 infected cells. Every minute each cell which has at least 2 infected neighbors gets infected as well. Is it possible for the entire chessboard to get infected eventually?
Please confirm you want to block this member.
You will no longer be able to:
Please allow a few minutes for this process to complete.
Notifications
