Reverse Puzzling

George is a great puzzler, so I was extremely surprised when he didn’t immediately know the answer to a really famous puzzle. It’s a puzzle that you probably did years ago, and have heard so often you can do it from memory rather than working it out. It’s also not really that difficult, so I was also surprised when it appeared to be stumping him.

“Come on, surely you know this one,” I said.

“I don’t. And don’t call me Shirley.” He answered grumpily. I could tell his mood was declining rapidly, but like any great puzzler he was down and not out, and I watched his facial expression change as he reached into his mental bag of tricks. He nodded towards a conveniently located whiteboard. “Have you got a marker for that?”

I handed him one, and he drew up the following diagram:

He stepped back, admiring his work, beaming proudly. “Well, now the solution is very obvious!” he commented. And indeed it was. The question for you is:

What is the puzzle?

The diagram represents the puzzle about the man, trying to cross the river with a fox (F), a chicken (C) and a sack of barley (B). He can carry at most one of them with himself in the boat, and he shouldn’t leave the chicken alone with the fox or with the barley on one side of the river. The red dots represent all admissable configurations and the lines between them all available moves.

Source:

Puzzling StackExchange

Athletics Competition

An athletics competition, organized periodically, rewards a medal to 79 winners, 47 runner-ups, and an indeterminate number of third places. If 50 cans of drink are served for refreshment, how many policemen are needed to keep order?

The numbers are references to elements in the periodic table. 79 is the number of Gold, 47 is the number of Silver, 50 is the number of Tin, and Bronze is not in the periodic table. Since 29 is the number of Copper, it should be the correct answer.

Source:

Puzzling StackExchange

Yes, No, I Don’t Know

Your friend is thinking of a number among 1, 2, and 3. You can ask him just one question, to which he is allowed to answer only with “yes”, “no”, or “I don’t know”. What would you ask him in order to find his number?

You can ask him the following:

“If I am thinking of a number among 1 and 2, is your number going to be bigger than mine?”

If your friend’s number is 1, he will say “no”. If his number is 2, he will say “I don’t know”. If his number is 3, he will say “yes”.

68 Coins, 100 Weighings

You have 68 coins with different weights. How can you find both the lightest and the heaviest coins with 100 scale weighings?

1. Compare the coins in pairs and separate the light ones in one group and the heavy ones in another. (34 weighings)
2. Find the lightest coin in the first group of 34 coins. (33 weighings)
3. Find the heaviest coin in the second group of 34 coins. (33 weighings)

Stopped Wall Clock

Ben has a wall clock in his room, but he didn’t wind it one day, so it stopped working. Later that day he left his house, walked to his best friend’s place, who has his own, always precise clock, stayed there for a while, then walked back home. When he arrived, he went to his wall clock and adjusted it to show the correct time. How did Ben do it, if he didn’t see any other clocks during the day, except for the one at his best friend’s place?

Before Ben left his place, he winded his clock. When he went to his friend’s place, he noted for how long he stayed there, say X, and at what time he left, say Y. After Ben got back home, he looked at his own wall clock and calculated the time he was outside, say Z. Then he concluded that the time he was walking was Z – X in total, and therefore it took him (Z – X)/2 time to get from his friend’s place to his own house. He added Y (the time he left his friend’s place) and got Y + (Z – X)/2, the correct time.

FEATURED

Princess in a Palace

A princess is living in a palace which has 17 bedrooms, arranged in a line. There is a door between every two neighboring bedrooms and also a hallway which connects them all. Every night the princess moves through the inner doors from one bedroom to another. Every morning for 30 consecutive days you are allowed to go to the hallway and knock on one of the 17 doors. If the princess is inside, you will marry her. What would your strategy be?

You knock on doors:
2, 3,…, 15, 16, 16, 15,…, 3, 2.
This adds up to a total of 30 days exactly. If during the first 15 days you don’t find the princess, this means that every time you were knocking on an even door, she was in an odd room, and vice versa. Now it is easy to see that in the next 15 days you can’t miss her.

Move Move Chess

Consider a chess game in which every player is allowed to move twice per turn. Show that Black does not have a winning strategy.

Assume Black has a winning strategy. Then if White plays Kb1-Kc3 and Kc3-b1 on his first turn, the game basically will start all over again, but with Black moving first. Therefore White will have a winning strategy, which is a contradiction.

Codex Enigmatum

These are a few enigmas from the puzzle book CODEX ENIGMATUM. What is the answer to puzzle #9?

  • Puzzle #2 After turning the first wheel 22 times to the right, then 19 times to the left, then 15 times to the right, and finally 11 times to the left, the final wheel will spell the word EXIT.
  • Puzzle #3 The total number of spots on the hidden sides of the die on the left is 6, which corresponds to the sixth letter in the alphabet – F. Therefore, the four dice on the right correspond to the letters K, I, N, G.
  • Puzzle #4 In the mosaic on the right, you can find a little star which contains pieces with letters H, I, D, E.
  • Puzzle #6 If you trace the signature on the paper, starting from the large C, you will pass through the letters C, O, N, T, I, N, U, O, U, S.
  • Puzzle #8 The picture on the left and the answer to puzzle #6 (“continuous”) suggest that we have to consider the images on the right which can be drawn continuously, without taking off the pencil from the paper or passing through any segment twice. These images are labeled with the letters N, O, S, E.
  • Puzzle #9 The first 2 letters from the word NOSE spell NO. The last letter from the word EXIT is T. The first letter from the word HIDE is H. The last three letters from the word KING spell ING. When you combine all of them, you get the word NOTHING.
Source:

Codex Enigmatum by Rami Hansenne