CLICK TO PRINT MAZE

]]>

BAG + LASS - GLASS + TRACK - RACK = BAT

]]>

Coming soon.

]]>

You have 68 coins with different weights. How can you find the lightest and the heaviest 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)

]]>

It is well known how to split fairly a cake between two people - one of them cuts, the other one picks. The question is, how can you split fairly a cake between three people?

Easy: "Fairly" means that every person gets at least 1/3 of the cake.

Hard: "Fairly" means that every person has the opportunity to get at least as much cake as any other.

Easy (Banach-Knaster method):

The first person cuts 1/3 piece of the cake. If the second person thinks it is larger than 1/3, he can trim it to 1/3. If the third person thinks the cut (and possibly trimmed) piece is larger than 1/3, he can trim it to 1/3 and keep it. Otherwise, the second person takes the piece if he decided to trim it, or the first one, in case he did not. After that, there are two people left, and they can easily split the remaining cake between them. This approach works for any number of people.

Hard (Selfridge-Conway method):

The first person cuts the cake in 3 pieces. The second one takes the biggest piece and trims it so that it becomes as large as the second biggest piece, puts the trimmings aside. The third person picks one of the three big pieces. Then, if the trimmed piece is still available, the second person takes it, if not - he picks whichever he likes. The first person takes the last remaining big piece.

Among the first two people, whoever did not pick the trimmed big piece, splits the trimmings in 3 parts. The other one picks one of these parts, then the first person picks another. The last part goes to the person who split the trimmings.

]]>

Coming soon.

]]>

You have two solid cubes of lead, which have almost the same size. You cut a hole in one of them and pass the other one through it. After measuring the cubes later, it turns out that the larger cube is still heavier than the smaller one. How is this possible?

You cut a hole in the SMALLER cube, and pass the larger cube through it.

]]>

- one red crescent;
- two yellow circles, connected by a yellow line;
- three blue crosses in a row;
- a block with four pairs of leaves and five blue lines on an orange block.

CLICK TO PRINT MAZE

*Labyrinth: Find your way through 14 magical mazes*

By Theo Guignard

Published 2nd March by Wide Eyed Editions

ISBN: 9781847809988

]]>

In order to do this, first cross your arms, and from this position, grab the two ends of the rope. Once you untangle your arms, the knot will appear on the rope.

]]>

This game is a win for White.

1. c7 Rd6+ 2. Kb5 Rd5+ 3. Kb4 Rd4+ 4. Kb3 Rd3+ 5. Kc2! Rd4! 6. c8=R! Ra4 7. Kb3 Now Black will either lose the rook, or get mated in one. If White promoted a Queen instead of a Rook, then 6... Rc4+ would lead to 7. Qxc4, which is a stalemate.

]]>

One snowy night, Sherlock Holmes was in his house sitting by a fire. All of a sudden a snowball came crashing through the window, breaking it. Holmes got up and looked out just in time to see three neighborhood kids who were brothers run around the corner. Their names were John Crimson, Mark Crimson and Paul Crimson.

The next day Holmes got a note on his door that read:

Which of the three Crimson brothers should Sherlock Holmes question about the incident?

He should question Mark. The note read:

"QUESTION MARK Crimson. He broke your window."

]]>

*Remark: The bridge is exactly as long as the river is wide, and must be placed straight across it. Additionally, it has some positive width.*

Notice that no matter how the bridge gets placed over the river, the shortest path would be to go to its top left corner, then traverse it diagonally, then go from its bottom right corner to Redbird. The second part of the way has fixed length, so we must minimize the first part plus the third part. In order to do that, imagine we place the bridge, so that its top left corner is at the current position of Pinkbird - point A. If the bottom right corner ends up at point C, then we must connect C with the position of Redbird - point B, and wherever the line intersects the bottom shore - point D, that will be the best place for the bottom right corner of the bridge.

]]>

CLICK TO PRINT MAZE

*"3-D Space Mazes"Published November 30 by Dover PublicationsISBN: *9780486287720

A is connected to E. B is connected to C. D is connected to F.

]]>

- educational toy
- cool sound and visual effects
- highly recommended

Solve if you are a true genius. 97% will fail.

*Concept by Puzzle Prime, art by Nizar Ilman.*

]]>

Yes, it is possible to design such curve.

]]>

Huey must take 1 chocolate, and Dewey must take 7. This is because each of them ate 8/3 donuts, and therefore Huey gave away 1/3 of his donuts, and Dewey gave away 7/3 of his donuts.

]]>

The answer is corn.

]]>

BEER - BEE + HOD + DAME - DAM + ISLAND = RHODE ISLAND

]]>

At most 1 of these statements is correct.

At most 2 of these statements are correct.

...

At most 98 of these statements are correct.

At most 99 of these statements are correct.

How many of these statements are correct?

If the number of true statements is X, then statements 1, 2, ... , X are wrong, and the rest are correct. Therefore X = 100 - X and X = 50. Thus, there are 50 correct statements.

]]>