Hungry Lion

A hungry lion runs inside a circus arena which is a circle of radius 10 meters. Running in broken lines (i.e. along a piecewise linear trajectory), the lion covers 30 kilometers. Prove that the sum of all turning angles is at least 2998 radians.

Source: The Puzzle Toad

Imagine the lion is static and instead the center of the arena moves around. Then, the problem translates to a point inside the arena alternating between traveling straight South and then moving north along arcs around the center of the arena. Since the total distance traveled straight South is 30KM and the distance between the starting and the ending points is at most 20M, the total distance traveled North must be at least 30KM – 20M = 29980M. The radius of the arena is 10M, so this corresponds to at least 2998 radians.

Minecraft: Magnetic Travel Puzzle

Review

Minecraft: Magnetic Travel Puzzle (M:MTP for short) is a travel game by ThinkFun in which the goal is to arrange 3 types of objects, each coming in 3 different colors, in a 3 by 3 grid, such that certain conditions are satisfied.

As you progress through the 40 included challenges, the types of conditions you encounter become gradually more complex. While in the beginning you may be given all the colors of the objects with one clue and all the types of the objects with another, later on you need to analyze 5 or 6 clues at once, which makes the game more challenging and fun. That being said, at the hardest levels, M:MTP is still relatively easy, so experienced puzzlers will probably breeze through it within an hour or two.

At its core, M:MTP is identical to ThinkFun’s previously released Clue Master. Both games are presented in the form of magnetic notebooks, so they are easy to pick up and travel around with. The illustrations of the Minecraft edition are all based on the popular video game, so its fans may be particularly appreciative.

In conclusion, if you are looking for a casual puzzle to pass an hour or two on a road trip, then M:MTP would be a great choice. I only wish there were more challenges included, especially more difficult ones.

  • 1 player, 8 years and up
  • 40 challenges with increasing difficulties
  • easy to transport and play on the go
  • cool Minecraft based art
  • most puzzles can be solved with a few simple techniques

GET M:MTP HERE

* This post contains affiliate links. We may receive a small compensation if you make a purchase.

Houses on a Farm

Is it possible to connect each of the houses with the well, the barn, and the mill, so that no two connections intersect each other?

No, it is impossible. Here is a convincing, albeit a informal proof.

Imagine the problem is solvable. Then you can connect House A to the Well, then the Well to House B, then House B to the Barn, then the Barn to House C, then House C to the Mill, and finally the Mill to House A. Thus, you will create one loop with 6 points on it, such that houses and non-houses are alternating along the loop. Now, you must connect Point 1 with Point 4, Point 2 with Point 5, Point 3 with Point 6, such that the three curves do not intersect each other. However, you can see that you can draw no more than one such curve neither on the inside, nor the outside of the loop. Therefore, the task is indeed impossible.

More rigorous, mathematical proof can be made using Euler’s formula for planar graphs. We have that F + V – E = 2, where F is the number of faces, V is the number of vertices, and E is the number of edges in the planar graph. We have V = 6 and E = 9, and therefore F = 5. Since no 2 houses or 2 non-houses can be connected with each other, every face in this graph must have at least 4 sides (edges). Therefore, the total number of sides of all faces must be at least 20. However, this is impossible, since every edge is counted twice as a side and 20/2 > 9.

Game of Coins

Kuku and Pipi decide to play a game. They arrange 50 coins in a line on the table, with various nominations. Then alternating, each player takes on his turn one of the two coins at the end of the line and keeps it. Kuku and Pipi continue doing this, until after the 50th move all coins are taken. Prove that whoever starts first can always collect coins with at least as much value as his opponent.

Let’s assume Kuku starts first. In the beginning, he calculates the total value of the coins placed on odd positions in the line and compares it with the total value of the coins placed on even positions in the line. If the former has a bigger total value, then on every turn he takes the end coin which was placed on odd position initially. If the latter has bigger value, then on every turn he takes the end coin which was placed on even position initially. It is easy to see that he can always do this because after each of Pipi’s turns there will be one “odd” coin and one “even” coin at the ends of the line.